style: format js/ts code

Author: yanglbme

basic/sorting/HeapSort/Main.js

@@ -21,7 +21,6 @@ function heapify(arr, n, i) {
     }
 }
 
-
 function buildHeap(arr, n) {
     const lastNode = n - 1;
     const lastParent = Math.floor((lastNode - 1) / 2);
@@ -40,6 +39,6 @@ function heapSort(arr, n) {
 
 function main(arr, n, m) {
     heapSort(arr, n);
-    const list = arr.slice(0, m)
+    const list = arr.slice(0, m);
     console.log(list.join(' '));
 }

basic/sorting/MergeSort/Main.js

@@ -1,14 +1,14 @@
-var buf = "";
+var buf = '';
 
-process.stdin.on("readable", function () {
+process.stdin.on('readable', function () {
     var chunk = process.stdin.read();
     if (chunk) buf += chunk.toString();
 });
 
 let getInputArgs = line => {
     return line
-        .split(" ")
-        .filter(s => s !== "")
+        .split(' ')
+        .filter(s => s !== '')
         .map(x => parseInt(x));
 };
 
@@ -41,12 +41,12 @@ function mergeSort(nums, left, right) {
     }
 }
 
-process.stdin.on("end", function () {
-    buf.split("\n").forEach(function (line, lineIdx) {
+process.stdin.on('end', function () {
+    buf.split('\n').forEach(function (line, lineIdx) {
         if (lineIdx % 2 === 1) {
             nums = getInputArgs(line);
             mergeSort(nums, 0, nums.length - 1);
-            console.log(nums.join(" "));
+            console.log(nums.join(' '));
         }
     });
 });

basic/sorting/QuickSort/Main.js

@@ -1,14 +1,14 @@
-var buf = "";
+var buf = '';
 
-process.stdin.on("readable", function () {
+process.stdin.on('readable', function () {
     var chunk = process.stdin.read();
     if (chunk) buf += chunk.toString();
 });
 
 let getInputArgs = line => {
     return line
-        .split(" ")
-        .filter(s => s !== "")
+        .split(' ')
+        .filter(s => s !== '')
         .map(x => parseInt(x));
 };
 
@@ -31,12 +31,12 @@ function quickSort(nums, left, right) {
     quickSort(nums, j + 1, right);
 }
 
-process.stdin.on("end", function () {
-    buf.split("\n").forEach(function (line, lineIdx) {
+process.stdin.on('end', function () {
+    buf.split('\n').forEach(function (line, lineIdx) {
         if (lineIdx % 2 === 1) {
             nums = getInputArgs(line);
             quickSort(nums, 0, nums.length - 1);
-            console.log(nums.join(" "));
+            console.log(nums.join(' '));
         }
     });
 });

lcof2/剑指 Offer II 048. 序列化与反序列化二叉树/Solution.js

@@ -13,7 +13,7 @@
  * @return {string}
  */
 var serialize = function (root) {
-    return rserialize(root, "");
+    return rserialize(root, '');
 };
 
 /**
@@ -23,23 +23,23 @@ var serialize = function (root) {
  * @return {TreeNode}
  */
 var deserialize = function (data) {
-    const dataArray = data.split(",");
+    const dataArray = data.split(',');
     return rdeserialize(dataArray);
 };
 
 const rserialize = (root, str) => {
     if (root === null) {
-        str += "#,";
+        str += '#,';
     } else {
-        str += root.val + "" + ",";
+        str += root.val + '' + ',';
         str = rserialize(root.left, str);
         str = rserialize(root.right, str);
     }
     return str;
 };
 
 const rdeserialize = dataList => {
-    if (dataList[0] === "#") {
+    if (dataList[0] === '#') {
         dataList.shift();
         return null;
     }

lcs/LCS 02. 完成一半题目/Solution.js

@@ -2,7 +2,7 @@
  * @param {number[]} questions
  * @return {number}
  */
- var halfQuestions = function(questions) {
+var halfQuestions = function (questions) {
     let counter = new Array(1010).fill(0);
     for (const q of questions) {
         ++counter[q];
@@ -15,4 +15,4 @@
         n -= counter[i];
     }
     return ans;
-};
+};

solution/2300-2399/2335.Minimum Amount of Time to Fill Cups/Solution.ts

@@ -1,7 +1,7 @@
 function fillCups(amount: number[]): number {
     amount.sort((a, b) => a - b);
     let [a, b, c] = amount;
-    let diff =  (a + b) - c;
+    let diff = a + b - c;
     if (diff <= 0) return c;
-    else return Math.floor((diff + 1) / 2)  + c;
-};
+    else return Math.floor((diff + 1) / 2) + c;
+}