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
Android studio doesnt work when in full screen mac os
Java
2 votes265 views1 answer
Intellij run java file
Java
2 votes267 views1 answer
Convert hashset to array
Java
0 vote267 views1 answer
Ciclo for para percorere duas listas java
Java
0 vote263 views1 answer
Room insert and return id
Java
0 vote281 views2 answers
How to do two constructors with super
Java
1 vote256 views1 answer
Variable between two numbers java
Java
0 vote259 views1 answer
Java difrence betwen x++ and ++x
Java
64 votes262 views6 answers
Get last element of array java
Java
0 vote262 views1 answer
How to change custom font to bold italic in java
Java