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 vote375 views1 answer
CheckIndex Java
Java
4 votes347 views3 answers
Spigot scheduler
Java
-2 votes356 views2 answers
Change java version maven
Java
1 vote349 views1 answer
Cannot resolve class android.support.design.widget.CoordinatorLayout
Java
0 vote391 views1 answer
How to open a desktop application using java
Java
1 vote389 views1 answer
How to vibrate android java
Java
1 vote322 views1 answer
How to close the fragment by a close button in android
Java
6 votes318 views2 answers
Continue in java
Java
0 vote340 views1 answer
Dialog background dimming in android
Java
-2 votes317 views1 answer
Java stackover
Java