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 vote102 views1 answer
How to circular a bitmap android
Java
6 votes143 views2 answers
Count the number of words in a string java
Java
0 vote108 views1 answer
Java binary exponentiation
Java
1 vote100 views2 answers
Java pass method as parameter
Java
0 vote115 views1 answer
Kotlin spinner default value
Java
0 vote119 views1 answer
Kotlin const to Java
Java
0 vote101 views1 answer
Add two numbers in java
Java
0 vote109 views1 answer
How to get token oauth2.0 java example response
Java
0 vote101 views1 answer
Kubernetes java client create namespace
Java
0 vote105 views1 answer
Set gamemode of player spigot
Java