add JS solutions

Author: clingoram

javascript/LeetCode/Array/1184.js

@@ -0,0 +1,33 @@
+/**
+ * 1184. Distance Between Bus Stops
+ * 
+ * 從圓中(distance)找出從start到destination最短的距離
+ * 
+ * @param {number[]} distance
+ * @param {number} start
+ * @param {number} destination
+ * @return {number}
+ */
+var distanceBetweenBusStops = function(distance, start, destination) {
+  let res = 0,total = distance.reduce((a,b)=>a + b);
+  if(start > destination){
+    let temp = start;
+    start = destination;
+    destination = temp;
+  }
+  for(let i = 0;i < distance.length;++i) {
+    if(i >= start && i < destination){
+      res += distance[i]
+    }
+  }
+  return Math.min(res,total - res);
+};
+//             [0,1,2,3]
+// let distance = [1,2,3,4], start = 0, destination = 2;
+// ans.3 => 2+1
+// 7 => 1+2+4
+// Distance between 0 and 2 is 3 or 7, minimum is 3.
+
+let distance = [7,10,1,12,11,14,5,0], start = 7, destination = 2;
+// 17
+console.log(distanceBetweenBusStops(distance,start,destination));

javascript/LeetCode/math/3432.js

@@ -44,22 +44,37 @@
  */
 var countPartitions = function (nums) {
   // 左右皆不斷更新
-  let right = 0;
-  let left = 0;
-  // 加總後的值
-  let sum = 0;
-  // 操作次數
+  // let right = 0;
+  // let left = 0;
+  // // 加總後的值
+  // let sum = 0;
+  // // 操作次數
+  // let count = 0;
+  // for (let i = 0; i < nums.length; i++) {
+  //   sum += nums[i];
+  // }
+  // for (let i = 0; i < nums.length - 1; i++) {
+  //   left += nums[i];
+  //   // 總值 - 左邊 = 右邊
+  //   right = sum - left;
+
+  //   // 檢查兩邊是否都是偶數
+  //   if ((left % 2) === (right % 2)) {
+  //     count++;
+  //   }
+  // }
+  // return count;
+
+  // solution 2.
+  let sum = nums.reduce((a,b) => a + b);
   let count = 0;
-  for (let i = 0; i < nums.length; i++) {
-    sum += nums[i];
-  }
-  for (let i = 0; i < nums.length - 1; i++) {
+  let right = 0, left = 0;
+  for(let i = 0;i < nums.length;++i) {
+    // 左邊的元素會越來越多，右邊則會變少
     left += nums[i];
-    // 總值 - 左邊 = 右邊
     right = sum - left;
 
-    // 檢查兩邊是否都是偶數
-    if ((left % 2) === (right % 2)) {
+    if(right % 2 === 0 && left % 2 === 0){
       count++;
     }
   }

javascript/index.js

@@ -1114,4 +1114,3 @@ var mySqrt = function(x) {
 let x = 8;
 // 2
 // console.log(mySqrt(x));
-