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 vote252 views1 answer
Java map get key by value
Java
13 votes290 views2 answers
How to make a dictionary in java
Java
0 vote278 views1 answer
Generate a random number with math random java
Java
19 votes327 views4 answers
Minecraft start bat
Java
0 vote309 views1 answer
Ecludis
Java
0 vote296 views2 answers
Java Regex : 4 Letters followed by 2 Integers
Java
6 votes349 views2 answers
Get today's date java android studio
Java
15 votes312 views4 answers
Reverse int array java
Java
6 votes245 views2 answers
Abstract vs interface java
Java
0 vote279 views1 answer
Which exception is thrown when java is out of memory
Java