add codewars problem solution

Author: clingoram

javascript/codewar/array/16.js

@@ -0,0 +1,23 @@
+/**
+ * Parts of a list (7 kyu)
+ * 
+ * Divide a list (an array) of at least two elements into two non-empty parts.
+ * Elements of a pair must be in the same order as in the original array.
+ * 
+ * @param {string} arr 
+ * @return {string} 二維陣列
+ */
+function partlist(arr) {
+  let result = [];
+  for(let i = 1;i < arr.length;++i) {
+    let inside = [];
+    inside.push(arr.slice(0,i).join(" "));
+    inside.push(arr.slice(i).join(" "));
+    result.push(inside);
+  }
+  return result;
+}
+let arr = ["I", "wish", "I", "hadn't", "come"];
+// let expect = [["I", "wish I hadn't come"], ["I wish", "I hadn't come"], ["I wish I", "hadn't come"], ["I wish I hadn't", "come"]]
+// console.log(assert.deepEqual(partlist(arr),expect));
+console.log(partlist(arr));

javascript/index.js

@@ -1047,24 +1047,3 @@ let numerator = 1, denominator = 2;
 // "0.5"
 // console.log(fractionToDecimal(numerator,denominator));
 
-function partlist(arr) {
-  // divide a list (an array) of at least two elements into two non-empty parts.
-  // Elements of a pair must be in the same order as in the original array.
-  let result = [];
-  // 切成兩個元素
-  // front多一個字，end則少一個字
-  let front = arr[0];
-  let original = arr.join(" ");
-  // console.log(original)
-  let inside = [];
-  for(let i = 0;i < arr.length;++i) {
-    
-    // inside[i] = original[i];
-    // result.push(inside)
-  }
-  console.log(result)
-}
-let arr = ["I", "wish", "I", "hadn't", "come"];
-// let expect = [["I", "wish I hadn't come"], ["I wish", "I hadn't come"], ["I wish I", "hadn't come"], ["I wish I hadn't", "come"]]
-// console.log(assert.deepEqual(partlist(arr),expect));
-console.log(partlist(arr));