comefrom: <qiyuangong>416_Partition_Equal_Subset_Sum_1.py
code: def canPartition( nums):
      if nums is None or len(nums) == 0:
          return True
      volumn = 0
      for num in nums:
          volumn += num
      
      if volumn % 2 != 0:
          return False
      
      volumn /= 2
      dp = [False] * (volumn + 1)
      dp[0] = True
      for i in range(1, len(nums) + 1):
          for j in range(volumn, nums[i - 1] - 1, -1):
              dp[j] = dp[j] or dp[j - nums[i - 1]]
      return dp[volumn]
masked: def sample_funcname ( var_0 ) :
      if var_0 is None or len ( var_0 ) == 0 :
          return True
      var_5 = 0
      for var_6 in var_0 :
          var_5 += var_6
      if var_5 % 2 != 0 :
          return False
      var_5 /= 2
      var_10 = [ False ] * ( var_5 + 1 )
      var_10 [ 0 ] = True
      for var_12 in range ( 1 , len ( var_0 ) + 1 ) :
          for var_13 in range ( var_5 , var_0 [ var_12 - 1 ] - 1 , - 1 ) :
              var_10 [ var_13 ] = var_10 [ var_13 ] or var_10 [ var_13 - var_0 [ var_12 - 1 ] ]
      return var_10 [ var_5 ]
  