From b6b04cc035fa5b82d1a40cb9994f7cdb463bc466 Mon Sep 17 00:00:00 2001
From: "qingyi.liu" <qingyival@163.com>
Date: Sat, 5 Jun 2021 18:45:22 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0131.=E5=88=86=E5=89=B2?=
 =?UTF-8?q?=E5=9B=9E=E6=96=87=E4=B8=B2JavaScript=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0131.分割回文串.md | 33 +++++++++++++++++++++++++++++++-
 1 file changed, 32 insertions(+), 1 deletion(-)

diff --git a/problems/0131.分割回文串.md b/problems/0131.分割回文串.md
index c722af37..9d23fd13 100644
--- a/problems/0131.分割回文串.md
+++ b/problems/0131.分割回文串.md
@@ -292,7 +292,7 @@ class Solution {
 ```
 
 Python：
-```python3
+```py
 class Solution:
     def partition(self, s: str) -> List[List[str]]:
         res = []  
@@ -313,7 +313,38 @@ class Solution:
 
 Go：
 
+javaScript：
 
+```js
+/**
+ * @param {string} s
+ * @return {string[][]}
+ */
+const isPalindrome = (s, l, r) => {
+    for (let i = l, j = r; i < j; i++, j--) {
+        if(s[i] !== s[j]) return false;
+    }
+    return true;
+}
+
+var partition = function(s) {
+    const res = [], path = [], len = s.length;
+    backtracking(0);
+    return res;
+    function backtracking(i) {
+        if(i >= len) {
+            res.push(Array.from(path));
+            return;
+        }
+        for(let j = i; j < len; j++) {
+            if(!isPalindrome(s, i, j)) continue;
+            path.push(s.substr(i, j - i + 1));
+            backtracking(j + 1);
+            path.pop();
+        }
+    }
+};
+```
 
 
 -----------------------