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

5 votes203 views4 answers
How to round up in java
Java
15 votes186 views6 answers
Java convert array to list
Java
0 vote229 views1 answer
Javax dependency android
Java
0 vote209 views1 answer
Mock ioexception mockito on BufferedReader
Java
0 vote193 views1 answer
Shortcut to find a class in java project eclipse
Java
0 vote227 views1 answer
Spring data elasticsearch aggregation max
Java Spring
1 vote225 views1 answer
Spring xml file configuration
Java Spring
0 vote184 views1 answer
Minecraft detect specific item in chest with custom name
Java
1 vote163 views1 answer
Groupie android
Java
0 vote193 views1 answer
Java 8 Functional Interfaces
Java