Update Solution.java

Author: javadev

src/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java

@@ -1,7 +1,7 @@
 package g0401_0500.s0416_partition_equal_subset_sum;
 
 // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Level_2_Day_13_Dynamic_Programming
-// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2024_11_17_Time_6_ms_(99.66%)_Space_42.4_MB_(82.95%)
+// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2024_11_17_Time_5_ms_(99.88%)_Space_42.2_MB_(85.79%)
 
 public class Solution {
     public boolean canPartition(int[] nums) {
@@ -17,9 +17,6 @@ public boolean canPartition(int[] nums) {
         int[] arr = new int[sum + 2];
         int top = 0;
         for (int val : nums) {
-            if (val > sum) {
-                return false;
-            }
             if (val == sum) {
                 return true;
             }