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 vote246 views1 answer
Identifier in java
Java
8 votes172 views4 answers
Dockerfile execute command
Java
0 vote199 views5 answers
Static block in java
Java
1 vote216 views1 answer
Java calculate elapsedTime
Java
0 vote166 views4 answers
Classpath
Java
1 vote164 views1 answer
Graphql java print schema
Java
4 votes296 views1 answer
Dependency for spring security
Java Spring
0 vote208 views1 answer
System out java quick
Java
1 vote162 views1 answer
Why can we implement multiple interfaces in java
Java
2 votes166 views2 answers
Changer version java terminal
Java