File tree 6 files changed +74
-4
lines changed
6 files changed +74
-4
lines changed Original file line number Diff line number Diff line change 1- <!DOCTYPE html><html lang="en"><head><meta charset="UTF-8"/><meta name="viewport" content="width=device-width, initial-scale=1.0"/><meta http-equiv="X-UA-Compatible" content="ie=edge"/><title>LeetCode javascript solutions</title><link rel="shortcut icon" href="https://baffinlee.github.io/leetcode-javascript/static/img/favicon.png" type="image/png"/><link rel="stylesheet" href="https://baffinlee.github.io/leetcode-javascript/static/css/app.css"/></head><body><header class="list-header"><div class="row"><div class="name">Difficulty:</div><div class="value"><ul class="clearfix"><li class="selected"><a href="https://baffinlee.github.io/leetcode-javascript">Easy</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/hard">Hard</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/medium">Medium</a></li></ul></div></div><div class="row"><div class="name">Tag:</div><div class="value"><ul class="clearfix"><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/array">Array</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/hash-table">Hash Table</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/string">String</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/dynamic-programming">Dynamic Programming</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/backtracking">Backtracking</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/tree">Tree</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/depth-first-search">Depth-first Search</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/two-pointers">Two Pointers</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/math">Math</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/linked-list">Linked List</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/stack">Stack</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/divide-and-conquer">Divide and Conquer</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/heap">Heap</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/binary-search">Binary Search</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/greedy">Greedy</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/sort">Sort</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/bit-manipulation">Bit Manipulation</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/breadth-first-search">Breadth-first Search</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/union-find">Union Find</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/graph">Graph</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/design">Design</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/brainteaser">Brainteaser</a></li></ul></div></div></header><main><table><thead><tr><th class="other">ID</th><th>Title</th><th class="other">Difficulty</th></tr></thead><tbody><tr><td>1</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/two-sum.html">Two Sum</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>7</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/reverse-integer.html">Reverse Integer</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>9</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/palindrome-number.html">Palindrome Number</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>13</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/roman-to-integer.html">Roman to Integer</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>14</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/longest-common-prefix.html">Longest Common Prefix</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>20</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/valid-parentheses.html">Valid Parentheses</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>21</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/merge-two-sorted-lists.html">Merge Two Sorted Lists</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>26</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/remove-duplicates-from-sorted-array.html">Remove Duplicates from Sorted Array</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>27</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/remove-element.html">Remove Element</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>28</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/implement-strstr.html">Implement strStr()</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>35</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/search-insert-position.html">Search Insert Position</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>38</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/count-and-say.html">Count and Say</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>53</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/maximum-subarray.html">Maximum Subarray</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>58</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/length-of-last-word.html">Length of Last Word</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>66</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/plus-one.html">Plus One</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>67</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/add-binary.html">Add Binary</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>69</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/sqrtx.html">Sqrt(x)</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>70</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/climbing-stairs.html">Climbing Stairs</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>83</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/remove-duplicates-from-sorted-list.html">Remove Duplicates from Sorted List</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>88</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/merge-sorted-array.html">Merge Sorted Array</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>100</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/same-tree.html">Same Tree</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>101</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/symmetric-tree.html">Symmetric Tree</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>104</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/maximum-depth-of-binary-tree.html">Maximum Depth of Binary Tree</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>107</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/binary-tree-level-order-traversal-ii.html">Binary Tree Level Order Traversal II</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>108</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/convert-sorted-array-to-binary-search-tree.html">Convert Sorted Array to Binary Search Tree</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>110</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/balanced-binary-tree.html">Balanced Binary Tree</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>111</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/minimum-depth-of-binary-tree.html">Minimum Depth of Binary Tree</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>112</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/path-sum.html">Path Sum</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>118</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/pascals-triangle.html">Pascal's Triangle</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>119</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/pascals-triangle-ii.html">Pascal's Triangle II</a></td><td><span class="tag easy">Easy</span></td></tr></tbody></table></main><section class="paging"><ul class="clearfix"><li class="disabled"><a href="#"><</a></li><li class="selected"><a href="#">1</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/easy/page/2.html">2</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/easy/page/2.html">></a></li></ul></section><footer><a href="https://github.com/BaffinLee/leetcode-javascript" target="_blank"><img src="https://baffinlee.github.io/leetcode-javascript/static/img/github.png" alt="github"/></a></footer></body></html>
1+ <!DOCTYPE html><html lang="en"><head><meta charset="UTF-8"/><meta name="viewport" content="width=device-width, initial-scale=1.0"/><meta http-equiv="X-UA-Compatible" content="ie=edge"/><title>LeetCode javascript solutions</title><link rel="shortcut icon" href="https://baffinlee.github.io/leetcode-javascript/static/img/favicon.png" type="image/png"/><link rel="stylesheet" href="https://baffinlee.github.io/leetcode-javascript/static/css/app.css"/></head><body><header class="list-header"><div class="row"><div class="name">Difficulty:</div><div class="value"><ul class="clearfix"><li class="selected"><a href="https://baffinlee.github.io/leetcode-javascript">Easy</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/hard">Hard</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/medium">Medium</a></li></ul></div></div><div class="row"><div class="name">Tag:</div><div class="value"><ul class="clearfix"><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/array">Array</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/hash-table">Hash Table</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/string">String</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/dynamic-programming">Dynamic Programming</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/backtracking">Backtracking</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/tree">Tree</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/depth-first-search">Depth-first Search</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/two-pointers">Two Pointers</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/math">Math</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/linked-list">Linked List</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/stack">Stack</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/divide-and-conquer">Divide and Conquer</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/heap">Heap</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/binary-search">Binary Search</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/greedy">Greedy</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/sort">Sort</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/bit-manipulation">Bit Manipulation</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/breadth-first-search">Breadth-first Search</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/union-find">Union Find</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/graph">Graph</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/design">Design</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/brainteaser">Brainteaser</a></li></ul></div></div></header><main><table><thead><tr><th class="other">ID</th><th>Title</th><th class="other">Difficulty</th></tr></thead><tbody><tr><td>1</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/two-sum.html">Two Sum</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>7</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/reverse-integer.html">Reverse Integer</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>9</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/palindrome-number.html">Palindrome Number</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>13</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/roman-to-integer.html">Roman to Integer</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>14</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/longest-common-prefix.html">Longest Common Prefix</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>20</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/valid-parentheses.html">Valid Parentheses</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>21</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/merge-two-sorted-lists.html">Merge Two Sorted Lists</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>26</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/remove-duplicates-from-sorted-array.html">Remove Duplicates from Sorted Array</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>27</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/remove-element.html">Remove Element</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>28</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/implement-strstr.html">Implement strStr()</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>35</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/search-insert-position.html">Search Insert Position</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>38</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/count-and-say.html">Count and Say</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>53</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/maximum-subarray.html">Maximum Subarray</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>58</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/length-of-last-word.html">Length of Last Word</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>66</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/plus-one.html">Plus One</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>67</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/add-binary.html">Add Binary</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>69</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/sqrtx.html">Sqrt(x)</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>70</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/climbing-stairs.html">Climbing Stairs</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>83</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/remove-duplicates-from-sorted-list.html">Remove Duplicates from Sorted List</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>88</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/merge-sorted-array.html">Merge Sorted Array</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>100</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/same-tree.html">Same Tree</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>101</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/symmetric-tree.html">Symmetric Tree</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>104</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/maximum-depth-of-binary-tree.html">Maximum Depth of Binary Tree</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>107</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/binary-tree-level-order-traversal-ii.html">Binary Tree Level Order Traversal II</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>108</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/convert-sorted-array-to-binary-search-tree.html">Convert Sorted Array to Binary Search Tree</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>110</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/balanced-binary-tree.html">Balanced Binary Tree</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>111</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/minimum-depth-of-binary-tree.html">Minimum Depth of Binary Tree</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>112</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/path-sum.html">Path Sum</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>118</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/pascals-triangle.html">Pascal's Triangle</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>119</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/pascals-triangle-ii.html">Pascal's Triangle II</a></td><td><span class="tag easy">Easy</span></td></tr></tbody></table></main><section class="paging"><ul class="clearfix"><li class="disabled"><a href="#"><</a></li><li class="selected"><a href="#">1</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/easy/page/2.html">2</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/easy/page/3.html">3</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/easy/page/2.html">></a></li></ul></section><footer><a href="https://github.com/BaffinLee/leetcode-javascript" target="_blank"><img src="https://baffinlee.github.io/leetcode-javascript/static/img/github.png" alt="github"/></a></footer></body></html>
You can’t perform that action at this time.
0 commit comments