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 vote196 views1 answer
Setlist arraylist java swing example
Java
3 votes196 views1 answer
Update query jpa
Java
0 vote204 views1 answer
Merge sort algorithm in java short answer
Java
0 vote211 views1 answer
Java program pattern program to triangle using 100 numbers
Java
0 vote244 views1 answer
Mapping over a list of promises in javaascript
Java
0 vote227 views1 answer
How to get input of local date type java
Java
0 vote207 views2 answers
Find First and Last Position of Element in Sorted Array
Java
0 vote215 views1 answer
Java to check if its a number scanner
Java
0 vote222 views1 answer
Java codigo para criar um aleatorio entre valores
Java
2 votes217 views2 answers
Java find item in list by property
Java