docs(readme): all

Author: guocaoyi

README.md

@@ -1,54 +1,27 @@
-# LeetCode Problems
+# LeetCode For TypeScript
 
-LeetCode problems' solutions with TypeScript
+LeetCode problems' submissions & top randed with TypeScript.
+
+**Submissions** was completed by myself.
+
+**Top Randed** includes the best submissions complated by other guys in LeetCode.com with JavaScript.
+
+> Author: Yalda
+>
+> Github: [leetcode-ts](https://github.com/guocaoyi/leetcode-ts/)
+> Blog: [www.yalda.cn](https://www.yalda.cn)
+> Online Book: [www.yalda.cn/leetcode-ts](https://www.yalda.cn/leetcode-ts)
 
 ## Topics
 
-[Array](./TOPICS.md#array)×100
+[Array](./TOPICS.md#array)×100,
 [Dynamic Programming](./TOPICS.md#string),
 [Math](./TOPICS.md#),
 [String](./TOPICS.md#),
 [Tree](./TOPICS.md#),
-[Hash Table](./TOPICS.md#),
-[Depth-first Search](./TOPICS.md#),
-[Binary Search](./TOPICS.md#),
-[Tow Pointers](./TOPICS.md#),
-[Greedy](./TOPICS.md#),
-[Breadth-first Search](./TOPICS.md#),
-[Stack](./TOPICS.md#),
-[Backtracking](./TOPICS.md#),
-[Design](./TOPICS.md#),
-[Linked List](./TOPICS.md#),
-[Bit Manipulation](./TOPICS.md#),
-[Heap](./TOPICS.md#),
-[Graph](./TOPICS.md#),
-[Sort](./TOPICS.md#),
-[Union Find](./TOPICS.md#),
-[Divide and Conquer](./TOPICS.md#),
-[Binary Search Tree](./TOPICS.md#),
-[Trie](./TOPICS.md#),
-[Sliding Window](./TOPICS.md#),
-[Recursion](./TOPICS.md#),
-[Queue](./TOPICS.md#),
-[Segment Tree](./TOPICS.md#),
-[Minimax](./TOPICS.md#),
-[Random](./TOPICS.md#),
-[Binary Indexed Tree](./TOPICS.md#),
-[Topological Sort](./TOPICS.md#),
-[Brainteaser](./TOPICS.md#),
-[Geometry](./TOPICS.md#),
-[Map](./TOPICS.md#),
-[Rejection Sampling](./TOPICS.md#),
-[Reservoir Sampling](./TOPICS.md#),
-[Memoization](./TOPICS.md#),
 
 ## Algorithms
 
-| \# | Title | Topics | Difficulty |
-| :-- | :--------------------------------------------- | :--------: | :--------: |
-| 1 | Two Sum | String,Map | ❗ |
-| 2 | Add Tow Numbers | | ❗ |
-| 3 | Longest Substring Without Repeating Characters | | ❗ |
-| 4 | Median of Two Sorted Arrays | | ❗❗ |
-| 6 | ZigZag Conversion | | ❗❗❗ |
-| 14 | Longest Common Prefix | | ❗❗ |
+| \# | Title | Topics | Difficulty |
+| :--------------------------- | :------ | :--------: | :-------------------------------------: |
+| [1](algorithms/0001.Two Sum) | Two Sum | String,Map | {% em color="#5cb85c" %}Easy{% endem %} |

SUMMARY.md

@@ -1,6 +1,16 @@
 # Summary
 
-- [概览](README.md)
-- [Topics](topics.md)
-- [0001.Two Sum](./algorithms/0001.Two Sum/README.md)
-- [0014.Longest Common Prefix](./algorithms/0014.Longest Common Prefix/README.md)
+- [Introduction](README.md)
+- [Topics](TOPICS.md)
+- [0001.Two Sum](algorithms/0001.Two Sum/README.md)
+- [0003.Longest Substring Without Repeating Characters](algorithms/0003.Longest Substring Without Repeating Characters/README.md)
+- [0004.Median of Tow Sorted Arrays](algorithms/0004.Median of Tow Sorted Arrays/README.md)
+- [0014.Longest Common Prefix](algorithms/0014.Longest Common Prefix/README.md)
+- [0017.Letter Combinations of a Phone Number](algorithms/0017.Letter Combinations of a Phone Number/README.md)
+- [0074.Search a 2D Matrix](algorithms/0074.Search a 2D Matrix/README.md)
+- [0136.Single Number](algorithms/0136.Single Number/README.md)
+- [0169.Majority Element](algorithms/0169.Majority Element/README.md)
+- [0202.Happy Number](algorithms/0202.Happy Number/README.md)
+- [0240.Search a 2D Matrix II](algorithms/0240.Search a 2D Matrix II/README.md)
+- [0344.Reverse String](algorithms/0344.Reverse String/README.md)
+- [0724.Find Pivot Index](algorithms/0724.Find Pivot Index/README.md)

TOPICS.md

@@ -0,0 +1,10 @@
+# Related Topics
+
+- Array
+ - [0014.Longest Common Prefix](algorithms/0014.Longest Common Prefix/README.md)
+ - [0017.Letter Combinations of a Phone Number](algorithms/0017.Letter Combinations of a Phone Number/README.md)
+
+- String
+ - [0001.Two Sum](algorithms/0001.Two Sum/README.md)
+ - [0003.Longest Substring Without Repeating Characters](algorithms/0003.Longest Substring Without Repeating Characters/README.md)
+ - [0074.Search a 2D Matrix](algorithms/0074.Search a 2D Matrix/README.md)

algorithms/0001.Two Sum/README.md

@@ -1,16 +1,19 @@
 # 1. Two Sum
 
-Given an array of integers, return indices of the two numbers such that they add up to a specific target.
+Given an array of integers, return **indices** of the two numbers such that they add up to a specific target.
 
-You may assume that each input would have exactly one solution, and you may not use the same element twice.
+You may assume that each input would have **exactly** one solution, and you may not use the same element twice.
 
-**Example:**
+## Example
 
-```txt
+```bash
 Given nums = [2, 7, 11, 15], target = 9,
 
 Because nums[0] + nums[1] = 2 + 7 = 9,
 return [0, 1].
 ```
 
-## 解析
+## Related Topics
+
+- Array
+- Hash Table

algorithms/0001.Two Sum/index.ts

@@ -58,7 +58,6 @@ var twoSum = (nums: number[], target: number): number[] => {
  }
 };
 
-
 /**
  * 哈希遍历
  * @top

algorithms/0003.Longest Substring Without Repeating Characters/README.md

@@ -0,0 +1,31 @@
+# 3. Longest Substring Without Repeating Characters
+
+Given a string, find the length of the **longest substring** without repeating characters.
+
+## Example
+
+```bash
+Input: "abcabcbb"
+Output: 3
+Explanation: The answer is "abc", with the length of 3.
+```
+
+```bash
+Input: "bbbbb"
+Output: 1
+Explanation: The answer is "b", with the length of 1.
+```
+
+```bash
+Input: "pwwkew"
+Output: 3
+Explanation: The answer is "wke", with the length of 3.
+ Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
+```
+
+## Related Topics
+
+- Hash Table
+- Two Pointers
+- String
+- Sliding Window

algorithms/0004.Median of Tow Sorted Arrays/README.md

@@ -0,0 +1,29 @@
+# 4. Median of Tow Sorted Arrays
+
+There are two sorted arrays **nums1** and **nums2** of size m and n respectively.
+
+Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).
+
+You may assume **nums1** and **nums2** cannot be both empty.
+
+## Example
+
+```bash
+nums1 = [1, 3]
+nums2 = [2]
+
+The median is 2.0
+```
+
+```bash
+nums1 = [1, 2]
+nums2 = [3, 4]
+
+The median is (2 + 3)/2 = 2.5
+```
+
+## Related Topics
+
+- Array
+- Binary Search
+- Divide and Conquer

algorithms/0004.Median of Tow Sorted Arrays/index.ts

@@ -1,14 +1,8 @@
-# 14 Longest Common Prefix
-
-## Related Topics
-
-- String
-
-## Description
+# 14. Longest Common Prefix
 
 Write a function to find the longest common prefix string amongst an array of strings.
 
-If there is no common prefix, return an empty string "".
+If there is no common prefix, return an empty string `""`.
 
 ## Example
 
@@ -27,96 +21,6 @@ Explanation: There is no common prefix among the input strings.
 
 All given inputs are in lowercase letters a-z.
 
-## Thinking
-
-- \*\*
-
-## Submissions
-
-### I: 循环遍历
-
-刚拿到这题没有细想，认为这题比较简单；直接使用循环遍历的方式一遍一遍顺序访问数组。当子字符串不相等时 Break，结果却超时了。简单了分析了原因在长数组的情况下，过多的进行了顺序访问，实践复杂度为 O(k\*n)。便放弃广度优先，改为深读优先。后面发现，是长度为 1 的数组进入了死循环。
-
-- Status: Time Limit Exceeded
-- Last executed input: : `[""]`
-
-```typescript
-var longestCommonPrefix = function(strs: string[]) {
- let prefix: string = "";
- if (strs && strs.length > 0) {
- let point = 1;
- while (true) {
- prefix = strs[0].slice(0, point);
- for (let i = 0; i < strs.length; i++) {
- if (prefix !== strs[i].slice(0, point)) {
- return prefix.slice(0, prefix.length - 1);
- }
- }
- point++;
- }
- } else {
- return "";
- }
-};
-```
-
-### II: 单次遍历
-
-没有兼容好空字符串的问题（PS:条件不是 a-z 么？WTF?）
-
-- Status: Time Limit Exceeded
-- Last executed input: : `["",""]`
-
-```typescript
-var longestCommonPrefix = function(strs: string[]) {
- let prefix: string = "";
- if (strs.length == 1) {
- return strs[0];
- } else if (strs.length > 1) {
- let point = 1;
- while (true) {
- prefix = strs[0].slice(0, point);
- for (let i = 0; i < strs.length; i++) {
- if (prefix !== strs[i].slice(0, point)) {
- return prefix.slice(0, prefix.length - 1);
- }
- }
- point++;
- }
- return "";
- } else {
- return "";
- }
-};
-```
-
-### III: 单次遍历
-
-使用 `strs[0]` 作为初始前缀串，逐一遍历 `strs[]` 元素进行比较，如 `String.indexOf !== 0` 则自减长度 1，直至成立后继续访问后面的元素。
-
-- Status: Accepted
-- Runtime: 60ms > 92.74%
-- Memory: 33.8MB < 86.74%
-
-```typescript
-var longestCommonPrefix = (strs: string[]) => {
- if (strs && strs.length > 0) {
- let prefix: string = strs[0]; // 使用 strs[0] 作为初始前缀串
- for (let i = 1; i < strs.length; i++) {
- let subStr = strs[i];
- while (subStr.indexOf(prefix) !== 0) {
- // 不存在前缀子串
- prefix = prefix.slice(0, prefix.length - 1);
- if (prefix.length == 0) {
- return "";
- }
- }
- }
- return prefix;
- } else {
- return "";
- }
-};
-```
+## Related Topics
 
-## Top Ranked
+- String

algorithms/0014.Longest Common Prefix/README.md

@@ -43,7 +43,6 @@ var longestCommonPrefix = function(strs: string[]) {
  }
  point++;
  }
- return "";
  } else {
  return "";
  }
@@ -53,7 +52,7 @@ var longestCommonPrefix = function(strs: string[]) {
  * 单次遍历
  * @description 使用 `strs[0]` 作为初始前缀串，逐一遍历 `strs[]` 元素进行比较，如 `String.indexOf !== 0` 则自减长度 1，直至成立后继续访问后面的元素。
  * @status Accepted
- * @runtime 60ms > 92.74%
+ * @runtime 60ms < 92.74%
  * @memory 33.8MB < 86.74%
  */
 var longestCommonPrefix = (strs: string[]) => {