https://leetcode.cn/problems/check-if-string-is-a-prefix-of-array/

Author: masx200

README.md

@@ -584,6 +584,8 @@ https://leetcode.cn/problems/longest-palindromic-substring
 
 https://leetcode.cn/problems/remove-nth-node-from-end-of-list
 
+https://leetcode.cn/problems/check-if-string-is-a-prefix-of-array/
+
 #### 安装教程
 
 1. 安装`deno`

check-if-string-is-a-prefix-of-array/index.ts

@@ -0,0 +1,11 @@
+export default function isPrefixString(s: string, words: string[]): boolean {
+    for (const word of words) {
+        if (s.startsWith(word)) {
+            s = s.slice(word.length);
+            if (s.length === 0) return true;
+        } else {
+            return false;
+        }
+    }
+    return false;
+}

longest-palindromic-substring/index.ts

@@ -7,7 +7,7 @@ export default function longestPalindrome(s: string): string {
         const str1 = expand(s, i, i);
         const str2 = expand(s, i, i + 1);
         ans = [str1, str2].reduce((p, v) => (p.length > v.length ? p : v), ans);
-if(ans===s)return s
+        if (ans === s) return s;
         i = i + 1;
     }
     return ans;