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 vote325 views1 answer
Java jbutton hover
Java
1 vote275 views1 answer
Observer vs observable
Java
0 vote313 views1 answer
Java create arraylist with size
Java
-1 vote336 views1 answer
Java runtime.getruntime().exec
Java
0 vote309 views1 answer
Check first character of string is number java
Java
0 vote317 views1 answer
Java program to print decimal to octal conversion
Java
2 votes352 views10 answers
Java
Java
0 vote304 views1 answer
How to calculate exponential in java
Java
0 vote304 views1 answer
Log errors with stack traces spring
Java
1 vote330 views1 answer
Pytho count avro file
Java