structure refactor

Author: swiftwind0405

README.md

@@ -385,7 +385,7 @@ LeetCode
 |30|[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/)| |Hard|
 |29|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)| |Medium|
 |28|[Implement strStr()](https://leetcode.com/problems/implement-strstr/)| |Easy|
-|27|[Remove Element](https://leetcode.com/problems/remove-element/)| [js](./algorithms/removeElement/removeElement-js.md) |Easy|
+|27|[Remove Element](https://leetcode.com/problems/remove-element/)| [js](./algorithms/removeElement/removeElement.js) |Easy|
 |26|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)| |Easy|
 |25|[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)| |Hard|
 |24|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)| |Medium|
@@ -397,8 +397,8 @@ LeetCode
 |18|[4Sum](https://leetcode.com/problems/4sum/)| |Medium|
 |17|[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)| |Medium|
 |16|[3Sum Closest](https://leetcode.com/problems/3sum-closest/)| |Medium|
-|15|[3Sum](https://leetcode.com/problems/3sum/)| [js](./algorithms/3Sum/3Sum-js.md) |Medium|
-|14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)| [js](./algorithms/longestCommonPrefix/longestCommonPrefix-js.md) |Easy|
+|15|[3Sum](https://leetcode.com/problems/3sum/)| [js](./algorithms/3Sum/3Sum.js) |Medium|
+|14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)| [js](./algorithms/longestCommonPrefix/longestCommonPrefix.js) |Easy|
 |13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer/)| |Easy|
 |12|[Integer to Roman](https://leetcode.com/problems/integer-to-roman/)| |Medium|
 |11|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)| |Medium|
@@ -411,4 +411,4 @@ LeetCode
 |4|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)| |Hard|
 |3|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)| |Medium|
 |2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| |Medium|
-|1|[Two Sum](https://leetcode.com/problems/two-sum/) | [java](./algorithms/twoSum/twoSum-java.md), [js](./algorithms/twoSum/twoSum-js.md),[python](./algorithms/twoSum/twoSum-python.md) |Easy|
+|1|[Two Sum](https://leetcode.com/problems/two-sum/) | [java](./algorithms/twoSum/twoSum.java), [js](./algorithms/twoSum/twoSum.js),[python](./algorithms/twoSum/twoSum.py) |Easy|

algorithms/3Sum/3Sum-js.md renamed to algorithms/3Sum/3Sum-stanley.md

@@ -0,0 +1,33 @@
+var threeSum = function(nums) {
+    const result = [];
+  
+    const len = nums.length;
+    if (len < 3) {
+      return result;
+    }
+  
+    nums = nums.sort((a, b) => a - b);
+    for (let i = 0; i < len; i++) {
+      // 如果当前数组大于0，则三数之和一定大于0，所以结束循环
+      if (nums[i] > 0) break;
+      // 重复项跳过循环
+      if (i > 0 && nums[i] === nums[i-1]) continue;
+      let L = i + 1;
+      let R = len - 1;
+      while (L < R) {
+        const sum = nums[i] + nums[L] + nums[R];
+        if (sum === 0) {
+          // 跳过重复项
+          result.push([nums[i], nums[L], nums[R]])
+          while (L < R && nums[L] === nums[L + 1]) L++;
+          while (L < R && nums[R] === nums[R - 1]) R--;
+          L++;
+          R--;
+        }
+        else if (sum < 0) L++;
+        else if (sum > 0) R--;
+      }
+    }
+    return result;
+  };
+  

algorithms/3Sum/3Sum.js

@@ -0,0 +1,15 @@
+var longestCommonPrefix = function(strs) {
+	if (strs === null || strs.length === 0) return "";
+  if(strs.length === 1) return strs[0]
+  let min = 0, max = 0
+  for(let i = 1; i < strs.length; i++) {
+      if(strs[min] > strs[i]) min = i
+      if(strs[max] < strs[i]) max = i
+  }
+  for(let j = 0; j < strs[min].length; j++) {
+      if(strs[min].charAt(j) !== strs[max].charAt(j)) {
+          return strs[min].substring(0, j)
+      }
+  }
+  return strs[min];
+};

algorithms/longestCommonPrefix/longestCommonPrefix-js.md renamed to algorithms/longestCommonPrefix/longestCommonPrefix-stanley.md

@@ -0,0 +1,6 @@
+var removeElement = (nums, val) => {
+    while (nums.indexOf(val) !== -1) {
+      nums.splice(nums.indexOf(val),1)
+    }
+    return nums.length
+  }

algorithms/longestCommonPrefix/longestCommonPrefix.js

@@ -0,0 +1,10 @@
+public int[] twoSum(int[] nums, int target) {
+    Map<Integer, Integer> numsIndexMap = new HashMap();
+    for (int i = 0; i < nums.length; i++) {
+        if (numsIndexMap.containsKey(target - nums[i])) {
+            return new int[]{numsIndexMap.get(target - nums[i]), i};
+        }
+        numsIndexMap.put(nums[i], i);
+    }
+    throw new IllegalArgumentException();
+}

algorithms/removeElement/removeElement-js.md renamed to algorithms/removeElement/removeElement-stanley.md

@@ -0,0 +1,11 @@
+var twoSum = function(nums, target) {
+    const len = nums.length, map = {};
+    for(let i = 0; i < len; i++) {
+        const result = map[nums[i]];
+        // 第一个数字的index为0时，其实是一个假值，需要额外处理下
+        if (result === 0 || result) {
+            return [result, i];
+        }
+        map[target - nums[i]] = i;
+    }
+};

algorithms/removeElement/removeElement.js

@@ -0,0 +1,11 @@
+from typing import List
+
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        d = {}
+        n = len(nums)
+        for i in range(n):
+            if target - nums[i] in d:
+                return d[target - nums[i]], i
+            else:
+                d[nums[i]] = i