From 7aba93c8e1bbb3f623c1f67f9f2d7f794aaefd78 Mon Sep 17 00:00:00 2001
From: Steve2020 <841532108@qq.com>
Date: Thu, 20 Jan 2022 17:15:09 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=EF=BC=880459.=E9=87=8D?=
 =?UTF-8?q?=E5=A4=8D=E7=9A=84=E5=AD=90=E5=AD=97=E7=AC=A6=E4=B8=B2.md?=
 =?UTF-8?q?=EF=BC=89=EF=BC=9A=E5=A2=9E=E5=8A=A0typescript=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0459.重复的子字符串.md | 58 ++++++++++++++++++++++++++
 1 file changed, 58 insertions(+)

diff --git a/problems/0459.重复的子字符串.md b/problems/0459.重复的子字符串.md
index 9c74f4a7..ccfb485c 100644
--- a/problems/0459.重复的子字符串.md
+++ b/problems/0459.重复的子字符串.md
@@ -361,7 +361,65 @@ var repeatedSubstringPattern = function (s) {
 };
 ```
 
+TypeScript:
 
+> 前缀表统一减一
+
+```typescript
+function repeatedSubstringPattern(s: string): boolean {
+    function getNext(str: string): number[] {
+        let next: number[] = [];
+        let j: number = -1;
+        next[0] = j;
+        for (let i = 1, length = str.length; i < length; i++) {
+            while (j >= 0 && str[i] !== str[j + 1]) {
+                j = next[j];
+            }
+            if (str[i] === str[j + 1]) {
+                j++;
+            }
+            next[i] = j;
+        }
+        return next;
+    }
+
+    let next: number[] = getNext(s);
+    let sLength: number = s.length;
+    let nextLength: number = next.length;
+    let suffixLength: number = next[nextLength - 1] + 1;
+    if (suffixLength > 0 && sLength % (sLength - suffixLength) === 0) return true;
+    return false;
+};
+```
+
+> 前缀表不减一
+
+```typescript
+function repeatedSubstringPattern(s: string): boolean {
+    function getNext(str: string): number[] {
+        let next: number[] = [];
+        let j: number = 0;
+        next[0] = j;
+        for (let i = 1, length = str.length; i < length; i++) {
+            while (j > 0 && str[i] !== str[j]) {
+                j = next[j - 1];
+            }
+            if (str[i] === str[j]) {
+                j++;
+            }
+            next[i] = j;
+        }
+        return next;
+    }
+
+    let next: number[] = getNext(s);
+    let sLength: number = s.length;
+    let nextLength: number = next.length;
+    let suffixLength: number = next[nextLength - 1];
+    if (suffixLength > 0 && sLength % (sLength - suffixLength) === 0) return true;
+    return false;
+};
+```
 
 -----------------------
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>