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 vote171 views1 answer
Linux mint switch language
Java
0 vote194 views1 answer
Convert date to offsetdatetime in java
Java
1 vote129 views2 answers
Java list average
Java
35 votes240 views6 answers
Array java
Java
0 vote133 views2 answers
Worldedit api paste schematic
Java
0 vote198 views1 answer
The longest substring
Java
0 vote175 views1 answer
Jaggies
Java
0 vote212 views1 answer
Fhow to find location of java jdk
Java
1 vote183 views1 answer
Java real random
Java
0 vote173 views1 answer
Check if user has internet connection in kotlin
Java