Update 132-palindrome-partitioning-ii.js

Author: everthis

132-palindrome-partitioning-ii.js

@@ -7,19 +7,18 @@ const minCut = function(s) {
   const cut = new Array(n + 1).fill(0)
   for (let i = 0; i <= n; i++) cut[i] = i - 1
   for (let i = 0; i < n; i++) {
-    for (
-      let j = 0;
-      i - j >= 0 && i + j < n && s[i - j] == s[i + j];
-      j++ // odd length palindrome
-    )
-      cut[i + j + 1] = Math.min(cut[i + j + 1], 1 + cut[i - j])
-
+    // odd
+    for (let j = 0; i + j < n && i - j >= 0 && s[i + j] === s[i - j]; j++) {
+      cut[i + j + 1] = Math.min(cut[i + j + 1], cut[i - j] + 1)
+    }
+    // even
     for (
       let j = 1;
-      i - j + 1 >= 0 && i + j < n && s[i - j + 1] == s[i + j];
-      j++ // even length palindrome
-    )
-      cut[i + j + 1] = Math.min(cut[i + j + 1], 1 + cut[i - j + 1])
+      i + j < n && i - j + 1 >= 0 && s[i + j] === s[i - j + 1];
+      j++
+    ) {
+      cut[i + j + 1] = Math.min(cut[i + j + 1], cut[i - j + 1] + 1)
+    }
   }
   return cut[n]
 }