Leetcode 416

Using memoization
class Solution {
    public boolean canPartition(int[] nums) {
        
        Arrays.sort(nums);
        int total = 0;
        
        for(int num:nums)
        total+=num;
        
        
        if(total%2!=0)
        return false;
        
        return canPartition(nums,0,0,total, new HashMap<String, Boolean>());
        
    }
    
    public boolean canPartition(int[] nums, int index,  int sum , int total , HashMap<String,Boolean> state)
    {
        String current = index + "" + sum;
        
        if(state.containsKey(current))
            return state.get(current);
        
        if(sum*2==total)
            return true;
        
        if(sum > total || index >= nums.length)
            return false;
        
        boolean result =  canPartition(nums, index+1 , sum , total,state) ||  canPartition(nums,index+1,sum+nums[index],total,state );
        
        state.put(current, result);
        
        return result;
        
    }
    
}

Similar codes

1 vote172 views2 answers
Jsp redirect to another url
Java
0 vote161 views1 answer
Find subarray with given sum
Java
0 vote194 views1 answer
How to write a line in java
Java
-2 votes172 views1 answer
Java transaction example
Java
-1 vote171 views1 answer
Java string copy characters
Java
22 votes171 views5 answers
Binary Tree Height
Java
0 vote158 views1 answer
Java swing draw centered text
Java
0 vote200 views1 answer
Java how to open a link
Java
4 votes176 views2 answers
Navigate from one fragment to another android
Java
0 vote155 views1 answer
T implements comparable
Java