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

21 votes151 views4 answers
Java 2 decimals
Java
0 vote123 views1 answer
Random item from arraylist
Java
0 vote114 views1 answer
Jsp check if request parameter exists
Java
0 vote130 views1 answer
String to pojo java
Java
0 vote115 views4 answers
Trier un tableau de string java
Java
1 vote112 views1 answer
Attempt to invoke virtual method 'int java.util.Random.nextInt(int)' on a null object reference
Java
0 vote76 views2 answers
Create a recursive function to calculate the greatest common divisor in java
Java
0 vote121 views1 answer
Java remote debug
Java
0 vote116 views1 answer
Kkkkkkkkkkkkkk
Java
6 votes124 views3 answers
Math.round java
Java