Sync LeetCode submission Runtime - 67 ms (58.49%), Memory - 14.3 MB (62.62%)

Author: koralkulacoglu

LeetCode/0300-longest-increasing-subsequence/solution.cpp

@@ -6,11 +6,10 @@ class Solution {
         int ans = 1;
         for (int i=1; i<n; i++) {
             for (int j=0; j<i; j++) {
-                if (nums[i] > nums[j]) dp[i] = max(dp[i], dp[j]+1);
+                if (nums[i] > nums[j]) dp[i] = max(dp[i], dp[j] + 1);
+                ans = max(ans, dp[i]);
             }
-            ans = max(ans, dp[i]);
         }
-
         return ans;
     }
 };