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 vote128 views1 answer
T implements comparable
Java
1 vote145 views1 answer
Java get everything before a character
Java
0 vote142 views1 answer
Double if statement java
Java
0 vote87 views1 answer
Spring Security JWT Authentication + PostgreSQL – RestAPIs SpringBoot + Spring MVC + Spring JPA
Java
3 votes161 views1 answer
Maf-9dfodfhgdok[sdfjyug
Java
12 votes139 views3 answers
Hash map java
Java
0 vote153 views1 answer
Quicksort for arraylist
Java
0 vote193 views1 answer
"java.lang.ClassNotFoundException: javax.xml.bind.ValidationException"
Java
-1 vote132 views1 answer
Que es un length en java
Java
3 votes133 views2 answers
Java unique id
Java