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 vote172 views1 answer
How many of a char in a string java
Java
-2 votes229 views6 answers
Spring enable cors
Java Spring
3 votes218 views4 answers
Math java
Java
5 votes213 views2 answers
Write file java
Java
5 votes213 views1 answer
Java packages example
Java
3 votes195 views5 answers
How to disable screen rotation android studio
Java
1 vote197 views2 answers
Codeforces - 570b java
Java
0 vote197 views1 answer
How to create a udp protocol for transfer a big quantity of files java
Java
0 vote192 views1 answer
DMC5 performace mod
Java
3 votes194 views1 answer
Open link in android studio
Java