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

2 votes257 views1 answer
Android studio start another activity
Java
0 vote317 views1 answer
Difference between maven and cucumber test runner
Java
0 vote322 views2 answers
Java program to find the sum of all even numbers from 1 to 10
Java
0 vote341 views2 answers
Balanced string in java
Java
0 vote325 views1 answer
Rock paper scissors java
Java
0 vote287 views1 answer
Java format use same value multiple times
Java
1 vote273 views7 answers
Java to python
Java
6 votes294 views4 answers
Kotlin or java
Java
1 vote317 views1 answer
Android studio create a Uri
Java
1 vote312 views1 answer
Coding fill method java
Java