< Summary

Information
Class: LeetCode.Algorithms.PartitionEqualSubsetSum.PartitionEqualSubsetSumDynamicProgramming
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\PartitionEqualSubsetSum\PartitionEqualSubsetSumDynamicProgramming.cs
Line coverage
100%
Covered lines: 17
Uncovered lines: 0
Coverable lines: 17
Total lines: 48
Line coverage: 100%
Branch coverage
100%
Covered branches: 8
Total branches: 8
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
CanPartition(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\PartitionEqualSubsetSum\PartitionEqualSubsetSumDynamicProgramming.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv).
 3// All Rights Reserved.
 4// --------------------------------------------------------------------------------
 5// This software is the confidential and proprietary information of Eugene Eremeev
 6// (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not
 7// disclose such Confidential Information and shall use it only in accordance with
 8// the terms of the license agreement you entered into with Eugene Eremeev (also
 9// known as Yevhenii Yeriemeieiv).
 10// --------------------------------------------------------------------------------
 11
 12namespace LeetCode.Algorithms.PartitionEqualSubsetSum;
 13
 14/// <inheritdoc />
 15public class PartitionEqualSubsetSumDynamicProgramming : IPartitionEqualSubsetSum
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n * target)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <returns></returns>
 23    public bool CanPartition(int[] nums)
 224    {
 225        var total = nums.Sum();
 26
 227        if (total % 2 != 0)
 128        {
 129            return false;
 30        }
 31
 132        var target = total / 2;
 33
 134        var dp = new bool[target + 1];
 35
 136        dp[0] = true;
 37
 1138        foreach (var num in nums)
 439        {
 6040            for (var i = target; i >= num; i--)
 2641            {
 2642                dp[i] = dp[i] || dp[i - num];
 2643            }
 444        }
 45
 146        return dp[^1];
 247    }
 48}

Methods/Properties

CanPartition(System.Int32[])