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

1 vote219 views2 answers
Java arraylist with double
Java
2 votes198 views3 answers
How to set scroll to bottom jscrollpane
Java
0 vote217 views2 answers
Subtract two numbers without using arithmetic operators in java
Java
0 vote230 views1 answer
H2-in-mem
Java
0 vote203 views1 answer
Java makefile clean bin
Java
0 vote194 views1 answer
Android studio listview arrayadapter
Java
0 vote193 views1 answer
Character types java
Java
2 votes208 views2 answers
Leetcode even digits
Java
0 vote210 views1 answer
Windows Jmeter java.net.BindException: Address already in use: connect
Java
2 votes211 views1 answer
Java betrag
Java