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 vote231 views1 answer
List class type java
Java
9 votes99 views2 answers
{} when initialising arraylist java
Java
4 votes101 views3 answers
Regex for letters and number
Java
0 vote100 views1 answer
Get generic type of class at runtime
Java
0 vote115 views1 answer
Get host from request object java
Java
0 vote104 views1 answer
Textfield border radiuis in javafx
Java
0 vote121 views1 answer
Computeifabsent hashmap java
Java
0 vote134 views1 answer
This method requires a body instead of a semicolon java
Java
1 vote118 views1 answer
How to get index of second occurrence java
Java
0 vote108 views1 answer
How to convert character into operator
Java