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

0 vote143 views1 answer
Spring boot MVC config
Java Spring
1 vote117 views1 answer
Containskey java complexity
Java
0 vote131 views1 answer
How to give intent one project to othrer project activity in anroid
Java
0 vote120 views1 answer
My canvas java
Java
0 vote153 views1 answer
Java quote of the day
Java
3 votes123 views1 answer
Max long
Java
0 vote133 views1 answer
Get all colors in string spigot
Java
0 vote129 views1 answer
How to check the current user in firebase android
Java
2 votes124 views1 answer
System.arraycopy
Java
0 vote151 views1 answer
Build.plugins.plugin.version
Java