leetcode

Author: aouos

README.md

@@ -3,43 +3,44 @@
 | ID | Name | Difficulty | Tags | Remarks |
 | :---: | :--- | :---: | :---: | :--- |
 | 0001 | [twoSum](./code/0001_twoSum/) | ✦ | Array, Hash Table |  |
-| 0002 | [addTwoNumbers](./code/0002_addTwoNumbers.js) | ✦✦ | Math. linked List |  |
-| 0003 | [lengthOfLongestSubstring](./code/0003_lengthOfLongestSubstring.js) | ✦✦ | Hash Table, Two Pointers, Sliding Window |  |
-| 0007 | [reverse](./code/0007_reverse.js) | ✦ | Math |  |
-| 0009 | [isPalindrome](./code/0009_isPalindrome.js) | ✦ | Math |  |
-| 0012 | [intToRoman](./code/0012_intToRoman.js) | ✦✦ | Math, String |  |
-| 0013 | [romanToInt](./code/0013_romanToInt.js) | ✦ | Math, String |  |
-| 0015 | [threeSum](./code/0015_threeSum.js) | ✦✦ | Two Pointers, Array |  |
-| 0020 | [isValid](./code/0020_isValid.js) | ✦ | Stack, String |  |
-| 0026 | [removeDuplicates](./code/0026_removeDuplicates.js) | ✦ | Two Pointers, Array |  |
-| 0027 | [removeElement](./code/0027_removeElement.js) | ✦ | Two Pointers, Array |  |
-| 0028 | [strStr](./code/0028_strStr.js) | ✦ | Two Pointers, String |  |
-| 0030 | [findSubstring](./code/0030_findSubstring.js) | ✦✦✦ | Hash Table, Two Pointers, String |  |
-| 0031 | [nextPermutation](./code/0031_nextPermutation.js) | ✦✦ | Array |  |
-| 0034 | [searchRange](./code/0034_searchRange.js) | ✦✦ | Array, Binary Search |  |
-| 0035 | [searchInsert](./code/0035_searchInsert.js) | ✦ | Array, Binary Search |  |
-| 0070 | [climbStairs](./code/0070_climbStairs.js) | ✦ | DP |  |
-| 0074 | [searchMatrix](./code/0074_searchMatrix.js) | ✦✦ | Binary Search |  |
-| 0088 | [merge](./code/0088_merge.js) | ✦ | Array, Two Pointers |  |
-| 0118 | [generate](./code/0118_generate.js) | ✦ | Array |  |
-| 0121 | [maxProfit](./code/0121_maxProfit.js) | ✦ | Array, DP |  |
-| 0122 | [maxProfit](./code/0122_maxProfit.js) | ✦ | Greedy, Array |  |
-| 0134 | [canCompleteCircuit](./code/0134_canCompleteCircuit.js) | ✦✦ | Greedy |  |
-| 0136 | [singleNumber](./code/0136_singleNumber.js) | ✦ | Hash Table |  |
-| 0204 | [countPrimes](./code/0204_countPrimes/) | ✦ | Hash Table |  |
-| 0222 | [countNodes](./code/0222_countNodes.js) | ✦✦ | Tree, Binary Search |  |
-| 0239 | [maxSlidingWindow](./code/0239_maxSlidingWindow.js) | ✦✦✦ | Sliding Window |  |
-| 0297 | [serialize](./code/0297_serialize.js) | ✦✦✦ | Tree |  |
-| 0283 | [moveZeroes](./code/0283_moveZeroes.js) | ✦ | Array, Two Pointers |  |
-| 0328 | [oddEvenList](./code/0328_oddEvenList.js) | ✦✦ | Linked List |  |
-| 0347 | [topKFrequent](./code/0347_topKFrequent.js) | ✦✦ | Hash Table, Heap |  |
-| 0402 | [removeKdigits](./code/0402_removeKdigits.js) | ✦✦ | Stack, Greedy |  |
-| 0406 | [reconstructQueue](./code/0406_reconstructQueue.js) | ✦✦ | Greedy |  |
-| 0447 | [numberOfBoomerangs](./code/0447_numberOfBoomerangs.js) | ✦✦ | Hash Table, Math |  |
-| 0513 | [findBottomLeftValue](./code/0513_findBottomLeftValue.js) | ✦✦ | DFS, BFS, Tree |  |
-| 0514 | [findRotateSteps](./code/0514_findRotateSteps.js) | ✦✦✦ | DFS, DP |  |
-| 0922 | [sortArrayByParityII](./code/0922_sortArrayByParityII.js) | ✦ | Array, Sort |  |
-| 0942 | [validMountainArray](./code/0942_validMountainArray.js) | ✦ | Math |  |
-| 0987 | [verticalTraversal](./code/0987_verticalTraversal.js) | ✦✦ | Tree, Hash Table |  |
-| 1122 | [relativeSortArray](./code/1122_relativeSortArray.js) | ✦ | Array, Sort |  |
-| 1370 | [sortString](./code/1370_sortString.js) | ✦ | Sort |  |
+| 0002 | [addTwoNumbers](./code/0002_addTwoNumbers) | ✦✦ | Math. linked List |  |
+| 0003 | [lengthOfLongestSubstring](./code/0003_lengthOfLongestSubstring) | ✦✦ | Hash Table, Two Pointers, Sliding Window |  |
+| 0007 | [reverse](./code/0007_reverse) | ✦ | Math |  |
+| 0009 | [isPalindrome](./code/0009_isPalindrome) | ✦ | Math |  |
+| 0012 | [intToRoman](./code/0012_intToRoman) | ✦✦ | Math, String |  |
+| 0013 | [romanToInt](./code/0013_romanToInt) | ✦ | Math, String |  |
+| 0015 | [threeSum](./code/0015_threeSum) | ✦✦ | Two Pointers, Array |  |
+| 0020 | [isValid](./code/0020_isValid) | ✦ | Stack, String |  |
+| 0026 | [removeDuplicates](./code/0026_removeDuplicates) | ✦ | Two Pointers, Array |  |
+| 0027 | [removeElement](./code/0027_removeElement) | ✦ | Two Pointers, Array |  |
+| 0028 | [strStr](./code/0028_strStr) | ✦ | Two Pointers, String |  |
+| 0030 | [findSubstring](./code/0030_findSubstring) | ✦✦✦ | Hash Table, Two Pointers, String |  |
+| 0031 | [nextPermutation](./code/0031_nextPermutation) | ✦✦ | Array |  |
+| 0034 | [searchRange](./code/0034_searchRange) | ✦✦ | Array, Binary Search |  |
+| 0035 | [searchInsert](./code/0035_searchInsert) | ✦ | Array, Binary Search |  |
+| 0070 | [climbStairs](./code/0070_climbStairs) | ✦ | DP |  |
+| 0074 | [searchMatrix](./code/0074_searchMatrix) | ✦✦ | Binary Search |  |
+| 0088 | [merge](./code/0088_merge) | ✦ | Array, Two Pointers |  |
+| 0118 | [generate](./code/0118_generate) | ✦ | Array |  |
+| 0121 | [maxProfit](./code/0121_maxProfit) | ✦ | Array, DP |  |
+| 0122 | [maxProfit](./code/0122_maxProfit) | ✦ | Greedy, Array |  |
+| 0134 | [canCompleteCircuit](./code/0134_canCompleteCircuit) | ✦✦ | Greedy |  |
+| 0136 | [singleNumber](./code/0136_singleNumber) | ✦ | Hash Table |  |
+| 0204 | [countPrimes](./code/0204_countPrimes) | ✦ | Hash Table |  |
+| 0206 | [reverseList](./code/0206_reverseList) | ✦ | Linked List |  |
+| 0222 | [countNodes](./code/0222_countNodes) | ✦✦ | Tree, Binary Search |  |
+| 0239 | [maxSlidingWindow](./code/0239_maxSlidingWindow) | ✦✦✦ | Sliding Window |  |
+| 0297 | [serialize](./code/0297_serialize) | ✦✦✦ | Tree |  |
+| 0283 | [moveZeroes](./code/0283_moveZeroes) | ✦ | Array, Two Pointers |  |
+| 0328 | [oddEvenList](./code/0328_oddEvenList) | ✦✦ | Linked List |  |
+| 0347 | [topKFrequent](./code/0347_topKFrequent) | ✦✦ | Hash Table, Heap |  |
+| 0402 | [removeKdigits](./code/0402_removeKdigits) | ✦✦ | Stack, Greedy |  |
+| 0406 | [reconstructQueue](./code/0406_reconstructQueue) | ✦✦ | Greedy |  |
+| 0447 | [numberOfBoomerangs](./code/0447_numberOfBoomerangs) | ✦✦ | Hash Table, Math |  |
+| 0513 | [findBottomLeftValue](./code/0513_findBottomLeftValue) | ✦✦ | DFS, BFS, Tree |  |
+| 0514 | [findRotateSteps](./code/0514_findRotateSteps) | ✦✦✦ | DFS, DP |  |
+| 0922 | [sortArrayByParityII](./code/0922_sortArrayByParityII) | ✦ | Array, Sort |  |
+| 0942 | [validMountainArray](./code/0942_validMountainArray) | ✦ | Math |  |
+| 0987 | [verticalTraversal](./code/0987_verticalTraversal) | ✦✦ | Tree, Hash Table |  |
+| 1122 | [relativeSortArray](./code/1122_relativeSortArray) | ✦ | Array, Sort |  |
+| 1370 | [sortString](./code/1370_sortString) | ✦ | Sort |  |

code/0002_addTwoNumbers.js renamed to code/0002_addTwoNumbers/0002_addTwoNumbers.js

@@ -10,19 +10,6 @@
  * @param {ListNode} l2
  * @return {ListNode}
  */
-
-function ListNode(val, next) {
-  this.val = (val === undefined ? 0 : val)
-  this.next = (next === undefined ? null : next)
-}
-
-const l1 = new ListNode(2, null);
-l1.next = new ListNode(4, null);
-l1.next.next = new ListNode(3, null);
-const l2 = new ListNode(5, null);
-l2.next = new ListNode(6, null);
-l2.next.next = new ListNode(4, null);
-
 var addTwoNumbers = function (l1, l2) {
   let resNode = new ListNode(0, null);
   let current = resNode;
@@ -38,5 +25,4 @@ var addTwoNumbers = function (l1, l2) {
     l2 = l2 ? l2.next : null;
   }
   return resNode.next;
-};
-console.log(addTwoNumbers(l1, l2));
+};

code/0003_lengthOfLongestSubstring.js renamed to code/0003_lengthOfLongestSubstring/0003_lengthOfLongestSubstring.js

@@ -2,9 +2,6 @@
  * @param {string} s
  * @return {number}
  */
-
-const s = "abcabcbb";
-
 var lengthOfLongestSubstring = function (s) {
   let ans = 0;
   for (let i = 0; i < s.length; i++) {
@@ -23,6 +20,4 @@ var lengthOfLongestSubstring = function (s) {
     }
   }
   return ans;
-};
-
-console.log(lengthOfLongestSubstring(s));
+};

code/0007_reverse.js renamed to code/0007_reverse/0007_reverse.js

@@ -2,9 +2,6 @@
  * @param {number[]} nums
  * @return {number[][]}
  */
-
-const nums = [-1, 0, 1, 1, 2, 2, -1, -4];
-
 var threeSum = function (nums) {
   let res = [];
   // 数组长度小于3直接返回
@@ -41,6 +38,4 @@ var threeSum = function (nums) {
     }
   }
   return res;
-};
-
-console.log(threeSum(nums));
+};

code/0009_isPalindrome.js renamed to code/0009_isPalindrome/0009_isPalindrome.js

@@ -2,9 +2,6 @@
  * @param {number[]} nums
  * @return {number}
  */
-
-const nums = [0, 0, 1, 1, 1, 2, 2, 3, 3, 4];
-
 var removeDuplicates = function (nums) {
   if (nums.length === 0) {
     return [];
@@ -32,6 +29,4 @@ var removeDuplicates = function (nums) {
     len--;
   }
   return nums;
-};
-
-console.log(removeDuplicates(nums));
+};

code/0012_intToRoman.js renamed to code/0012_intToRoman/0012_intToRoman.js

@@ -3,10 +3,6 @@
  * @param {number} target
  * @return {number[]}
  */
-
-// const nums = [1, 2, 2, 2, 4, 5, 6, 7, 8], target = 0;
-const nums = [0, 0, 0, 1, 2, 3], target = 0;
-
 var searchRange = function (nums, target) {
   let ans = [-1, -1]
   if (nums.length === 0) {
@@ -39,5 +35,4 @@ var searchRange = function (nums, target) {
     }
   }
   return ans;
-};
-console.log(searchRange(nums, target));
+};

code/0013_romanToInt.js renamed to code/0013_romanToInt/0013_romanToInt.js

@@ -3,9 +3,6 @@
  * @param {number} target
  * @return {number}
  */
-
-const nums = [1, 3, 5, 6, 7, 8], target = 0;
-
 var searchInsert = function (nums, target) {
   // 定义指,l指向最左端,r指向最右端
   let l = 0, r = nums.length - 1, ans = nums.length;
@@ -21,6 +18,4 @@ var searchInsert = function (nums, target) {
     }
   }
   return ans;
-};
-
-console.log(searchInsert(nums, target));
+};

code/0015_threeSum.js renamed to code/0015_threeSum/0015_threeSum.js

@@ -3,10 +3,6 @@
  * @param {number} target
  * @return {boolean}
  */
-
-// const matrix = [[1, 3, 5, 7], [10, 11, 16, 20], [23, 30, 34, 50]], target = 3;
-const matrix = [[1,3],[5,8],[13,17],[28,45],[67,78]], target = 3;
-
 var searchMatrix = function (matrix, target) {
   if (matrix.length === 0) {
     return false;
@@ -39,6 +35,4 @@ var searchMatrix = function (matrix, target) {
     }
   }
   return false;
-};
-
-console.log(searchMatrix(matrix, target));
+};

code/0020_isValid.js renamed to code/0020_isValid/0020_isValid.js

@@ -5,7 +5,6 @@
  * @param {number} n
  * @return {void} Do not return anything, modify nums1 in-place instead.
  */
-const nums1 = [0], nums2 = [1], m = 0, n = 1;
 var merge = function (nums1, m, nums2, n) {
   let len1 = m - 1;
   let len2 = n - 1;
@@ -26,5 +25,4 @@ var merge = function (nums1, m, nums2, n) {
     nums1 = nums2.slice(0, n).concat(nums1.slice(n));
   }
   return nums1;
-};
-console.log(merge(nums1, m, nums2, n));
+};

code/0026_removeDuplicates.js renamed to code/0026_removeDuplicates/0026_removeDuplicates.js

@@ -3,8 +3,6 @@
  * @param {number[]} cost
  * @return {number}
  */
-// const gas = [1, 2, 3, 4, 5], cost = [3, 4, 5, 1, 2];
-const gas = [2, 3, 4], cost = [3, 4, 3];
 var canCompleteCircuit = function (gas, cost) {
   let len = gas.length;
   let i = 0;
@@ -27,5 +25,4 @@ var canCompleteCircuit = function (gas, cost) {
     }
   }
   return -1;
-};
-console.log(canCompleteCircuit(gas, cost));
+};

code/0027_removeElement.js renamed to code/0027_removeElement/0027_removeElement.js

@@ -2,12 +2,10 @@
  * @param {number[]} nums
  * @return {number}
  */
-let nums = [4, 1, 2, 1, 2];
 var singleNumber = function (nums) {
   let res = 0;
   for(const a of nums) {
     res ^= a;
   }
   return res;
-};
-console.log(singleNumber(nums));
+};

code/0028_strStr.js renamed to code/0028_strStr/0028_strStr.js

@@ -0,0 +1,22 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+/**
+ * @param {ListNode} head
+ * @return {ListNode}
+ */
+var reverseList = function (head) {
+  let cur = head;
+  let pre = null;
+  while (cur) {
+    const next = cur.next;
+    cur.next = pre;
+    pre = cur;
+    cur = next;
+  }
+  return pre;
+};

code/0030_findSubstring.js renamed to code/0030_findSubstring/0030_findSubstring.js

@@ -9,20 +9,6 @@
  * @param {TreeNode} root
  * @return {number}
  */
-
-function TreeNode(val, left, right) {
-  this.val = val;
-  this.left = left;
-  this.right = right;
-}
-
-let root = new TreeNode(1, null, null);
-root.left = new TreeNode(2, null, null);
-root.right = new TreeNode(3, null, null);
-root.left.left = new TreeNode(4, null, null);
-root.left.right = new TreeNode(5, null, null);
-root.right.left = new TreeNode(6, null, null);
-
 var countNodes = function (root) {
   let ans = 0;
   if (root === null) {
@@ -42,6 +28,4 @@ var countNodes = function (root) {
     }
   }
   return ans;
-};
-
-console.log(countNodes(root));
+};

code/0031_nextPermutation.js renamed to code/0031_nextPermutation/0031_nextPermutation.js

@@ -3,10 +3,6 @@
  * @param {number} k
  * @return {number[]}
  */
-
-// const nums = [1, 3, -1, -3, 5, 3, 6, 7], k = 3;
-const nums = [1, 2, 4, 5, -6, 3, -9, 6, -4, 6, 1, -3], k = 3;
-
 var maxSlidingWindow = function (nums, k) {
   let ans = [];
   if (nums.length === 0) {
@@ -27,6 +23,4 @@ var maxSlidingWindow = function (nums, k) {
     }
   }
   return ans;
-};
-
-console.log(maxSlidingWindow(nums, k));
+};

code/0034_searchRange.js renamed to code/0034_searchRange/0034_searchRange.js

@@ -2,9 +2,6 @@
  * @param {number[]} nums
  * @return {void} Do not return anything, modify nums in-place instead.
  */
-
-const nums = [0, 1, 0, 3, 12];
-
 var moveZeroes = function (nums) {
   // 双指针,遇到非0值进行位置交换
   for (let i = 0; i < nums.length; i++) {
@@ -21,6 +18,4 @@ var moveZeroes = function (nums) {
     }
   }
   return nums;
-};
-
-console.log(moveZeroes(nums));
+};