LeetCode总结

不念不忘少年蓝@ 2022-06-12 06:46 127阅读 0赞

本篇文章为转载， [原文链接][Link 1]（注：该地址非原作者地址，未找到原作者地址）

欢迎参考我的 [leetcode代码][leetcode]  
  
利用堆栈：  
[http://oj.leetcode.com/problems/evaluate-reverse-polish-notation/][http_oj.leetcode.com_problems_evaluate-reverse-polish-notation]  
[http://oj.leetcode.com/problems/longest-valid-parentheses/][http_oj.leetcode.com_problems_longest-valid-parentheses] （也可以用一维数组，贪心）  
[http://oj.leetcode.com/problems/valid-parentheses/][http_oj.leetcode.com_problems_valid-parentheses]  
[http://oj.leetcode.com/problems/largest-rectangle-in-histogram/][http_oj.leetcode.com_problems_largest-rectangle-in-histogram]  
特别注意细节： [http://oj.leetcode.com/problems/trapping-rain-water/][http_oj.leetcode.com_problems_trapping-rain-water]  
  
多种数据结构：  
[http://oj.leetcode.com/problems/lru-cache/][http_oj.leetcode.com_problems_lru-cache]  
[http://oj.leetcode.com/problems/substring-with-concatenation-of-all-words/][http_oj.leetcode.com_problems_substring-with-concatenation-of-all-words] (注意遍历方法）  
HASH： [http://oj.leetcode.com/problems/longest-consecutive-sequence/][http_oj.leetcode.com_problems_longest-consecutive-sequence]  
  
简单编程：  
[http://oj.leetcode.com/problems/longest-common-prefix/][http_oj.leetcode.com_problems_longest-common-prefix]  
[http://oj.leetcode.com/problems/string-to-integer-atoi/][http_oj.leetcode.com_problems_string-to-integer-atoi] (分析，控制语句）  
  
排序 & 查找：  
二分查找： [http://oj.leetcode.com/problems/search-a-2d-matrix/][http_oj.leetcode.com_problems_search-a-2d-matrix]  
二分查找进阶： [http://oj.leetcode.com/problems/search-for-a-range/][http_oj.leetcode.com_problems_search-for-a-range]  
二分查找应用： [http://oj.leetcode.com/problems/sqrtx/][http_oj.leetcode.com_problems_sqrtx]  
二分查找应用： [http://oj.leetcode.com/problems/search-insert-position/][http_oj.leetcode.com_problems_search-insert-position]  
二分查找变种： [http://oj.leetcode.com/problems/search-in-rotated-sorted-array/][http_oj.leetcode.com_problems_search-in-rotated-sorted-array]  
二分查找变种： [http://oj.leetcode.com/problems/search-in-rotated-sorted-array-ii/][http_oj.leetcode.com_problems_search-in-rotated-sorted-array-ii]  
  
简单数学：  
[http://oj.leetcode.com/problems/pascals-triangle/][http_oj.leetcode.com_problems_pascals-triangle]  
[http://oj.leetcode.com/problems/pascals-triangle-ii/][http_oj.leetcode.com_problems_pascals-triangle-ii]  
[http://oj.leetcode.com/problems/powx-n/][http_oj.leetcode.com_problems_powx-n]  
[http://oj.leetcode.com/problems/reverse-integer/][http_oj.leetcode.com_problems_reverse-integer]  
[http://oj.leetcode.com/problems/plus-one/][http_oj.leetcode.com_problems_plus-one]  
[http://oj.leetcode.com/problems/unique-paths/][http_oj.leetcode.com_problems_unique-paths]  
[http://oj.leetcode.com/problems/palindrome-number/][http_oj.leetcode.com_problems_palindrome-number]  
[http://oj.leetcode.com/problems/permutation-sequence/][http_oj.leetcode.com_problems_permutation-sequence]  
[http://oj.leetcode.com/problems/merge-intervals/][http_oj.leetcode.com_problems_merge-intervals]  
[http://oj.leetcode.com/problems/valid-number/][http_oj.leetcode.com_problems_valid-number]  
[http://oj.leetcode.com/problems/climbing-stairs/][http_oj.leetcode.com_problems_climbing-stairs]  
[http://oj.leetcode.com/problems/roman-to-integer/][http_oj.leetcode.com_problems_roman-to-integer]  
[http://oj.leetcode.com/problems/integer-to-roman/][http_oj.leetcode.com_problems_integer-to-roman]  
[http://oj.leetcode.com/problems/divide-two-integers/][http_oj.leetcode.com_problems_divide-two-integers]  
区间： [http://oj.leetcode.com/problems/insert-interval/][http_oj.leetcode.com_problems_insert-interval]  
  
大数的数学运算：  
[http://oj.leetcode.com/problems/add-binary/][http_oj.leetcode.com_problems_add-binary]  
[http://oj.leetcode.com/problems/add-two-numbers/][http_oj.leetcode.com_problems_add-two-numbers]  
  
数组：  
[http://oj.leetcode.com/problems/remove-element/][http_oj.leetcode.com_problems_remove-element]  
[http://oj.leetcode.com/problems/merge-sorted-array/][http_oj.leetcode.com_problems_merge-sorted-array]  
[http://oj.leetcode.com/problems/first-missing-positive/][http_oj.leetcode.com_problems_first-missing-positive]  
[http://oj.leetcode.com/problems/spiral-matrix/][http_oj.leetcode.com_problems_spiral-matrix]  
[http://oj.leetcode.com/problems/spiral-matrix-ii/][http_oj.leetcode.com_problems_spiral-matrix-ii]  
[http://oj.leetcode.com/problems/rotate-image/][http_oj.leetcode.com_problems_rotate-image]  
遍历技巧： [http://oj.leetcode.com/problems/container-with-most-water/][http_oj.leetcode.com_problems_container-with-most-water]  
[http://oj.leetcode.com/problems/two-sum/][http_oj.leetcode.com_problems_two-sum]  
[http://oj.leetcode.com/problems/3sum/][http_oj.leetcode.com_problems_3sum]  
[http://oj.leetcode.com/problems/3sum-closest/][http_oj.leetcode.com_problems_3sum-closest]  
[http://oj.leetcode.com/problems/4sum/][http_oj.leetcode.com_problems_4sum]  
[http://oj.leetcode.com/problems/set-matrix-zeroes/][http_oj.leetcode.com_problems_set-matrix-zeroes]  
用好标记数组： [http://oj.leetcode.com/problems/valid-sudoku/][http_oj.leetcode.com_problems_valid-sudoku]  
[http://oj.leetcode.com/problems/next-permutation/][http_oj.leetcode.com_problems_next-permutation]  
[http://oj.leetcode.com/problems/word-search/][http_oj.leetcode.com_problems_word-search]  
[http://oj.leetcode.com/problems/remove-duplicates-from-sorted-array/][http_oj.leetcode.com_problems_remove-duplicates-from-sorted-array]  
[http://oj.leetcode.com/problems/remove-duplicates-from-sorted-array-ii/][http_oj.leetcode.com_problems_remove-duplicates-from-sorted-array-ii]  
[http://oj.leetcode.com/problems/sort-colors/][http_oj.leetcode.com_problems_sort-colors]  
  
暴力方法/细节实现：  
[http://oj.leetcode.com/problems/max-points-on-a-line/][http_oj.leetcode.com_problems_max-points-on-a-line]  
  
链表：  
归并排序： [http://oj.leetcode.com/problems/sort-list/][http_oj.leetcode.com_problems_sort-list]  
插入排序： [http://oj.leetcode.com/problems/insertion-sort-list/][http_oj.leetcode.com_problems_insertion-sort-list]  
反转、插入： [http://oj.leetcode.com/problems/reorder-list/][http_oj.leetcode.com_problems_reorder-list]  
检测是否有环： [http://oj.leetcode.com/problems/linked-list-cycle/][http_oj.leetcode.com_problems_linked-list-cycle]  
确定链表环的起点： [http://oj.leetcode.com/problems/linked-list-cycle-ii/][http_oj.leetcode.com_problems_linked-list-cycle-ii]  
Deep Copy 带有随机指针的链表： [http://oj.leetcode.com/problems/copy-list-with-random-pointer/][http_oj.leetcode.com_problems_copy-list-with-random-pointer]  
链表细节： [http://oj.leetcode.com/problems/rotate-list/][http_oj.leetcode.com_problems_rotate-list]  
[http://oj.leetcode.com/problems/remove-duplicates-from-sorted-list/][http_oj.leetcode.com_problems_remove-duplicates-from-sorted-list]  
删除细节： [http://oj.leetcode.com/problems/remove-duplicates-from-sorted-list-ii/][http_oj.leetcode.com_problems_remove-duplicates-from-sorted-list-ii]  
[http://oj.leetcode.com/problems/partition-list/][http_oj.leetcode.com_problems_partition-list]  
[http://oj.leetcode.com/problems/swap-nodes-in-pairs/][http_oj.leetcode.com_problems_swap-nodes-in-pairs]  
Merge 两个链表： [http://oj.leetcode.com/problems/merge-two-sorted-lists/][http_oj.leetcode.com_problems_merge-two-sorted-lists]  
Merge 多链表： [http://oj.leetcode.com/problems/merge-k-sorted-lists/][http_oj.leetcode.com_problems_merge-k-sorted-lists]  
细节： [http://oj.leetcode.com/problems/reverse-nodes-in-k-group/][http_oj.leetcode.com_problems_reverse-nodes-in-k-group]  
[http://oj.leetcode.com/problems/remove-nth-node-from-end-of-list/][http_oj.leetcode.com_problems_remove-nth-node-from-end-of-list]  
[http://oj.leetcode.com/problems/reverse-linked-list-ii/][http_oj.leetcode.com_problems_reverse-linked-list-ii]  
  
二叉树遍历：递归 & 非递归  
[http://oj.leetcode.com/problems/same-tree/][http_oj.leetcode.com_problems_same-tree]  
前序： [http://oj.leetcode.com/problems/binary-tree-preorder-traversal/][http_oj.leetcode.com_problems_binary-tree-preorder-traversal]  
中序： [http://oj.leetcode.com/problems/binary-tree-inorder-traversal/][http_oj.leetcode.com_problems_binary-tree-inorder-traversal]  
后序： [http://oj.leetcode.com/problems/binary-tree-postorder-traversal/][http_oj.leetcode.com_problems_binary-tree-postorder-traversal]  
遍历变种： [http://oj.leetcode.com/problems/sum-root-to-leaf-numbers/][http_oj.leetcode.com_problems_sum-root-to-leaf-numbers]  
遍历变种： [http://oj.leetcode.com/problems/path-sum/][http_oj.leetcode.com_problems_path-sum]  
遍历变种： [http://oj.leetcode.com/problems/path-sum-ii/][http_oj.leetcode.com_problems_path-sum-ii]  
遍历变种： [http://oj.leetcode.com/problems/maximum-depth-of-binary-tree/][http_oj.leetcode.com_problems_maximum-depth-of-binary-tree]  
遍历变种： [http://oj.leetcode.com/problems/minimum-depth-of-binary-tree/][http_oj.leetcode.com_problems_minimum-depth-of-binary-tree]  
重建二叉树： [http://oj.leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/][http_oj.leetcode.com_problems_construct-binary-tree-from-preorder-and-inorder-traversal]  
重建二叉树： [http://oj.leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/][http_oj.leetcode.com_problems_construct-binary-tree-from-inorder-and-postorder-traversal]  
层次遍历变种： [http://oj.leetcode.com/problems/binary-tree-zigzag-level-order-traversal/][http_oj.leetcode.com_problems_binary-tree-zigzag-level-order-traversal]  
遍历变种： [http://oj.leetcode.com/problems/symmetric-tree/][http_oj.leetcode.com_problems_symmetric-tree]  
遍历应用： [http://oj.leetcode.com/problems/binary-tree-maximum-path-sum/][http_oj.leetcode.com_problems_binary-tree-maximum-path-sum]  
遍历应用： [http://oj.leetcode.com/problems/balanced-binary-tree/][http_oj.leetcode.com_problems_balanced-binary-tree]  
遍历应用： [http://oj.leetcode.com/problems/recover-binary-search-tree/][http_oj.leetcode.com_problems_recover-binary-search-tree]  
遍历应用： [http://oj.leetcode.com/problems/flatten-binary-tree-to-linked-list/][http_oj.leetcode.com_problems_flatten-binary-tree-to-linked-list]  
level遍历： [http://oj.leetcode.com/problems/binary-tree-level-order-traversal/][http_oj.leetcode.com_problems_binary-tree-level-order-traversal]  
level 遍历： [http://oj.leetcode.com/problems/binary-tree-level-order-traversal-ii/][http_oj.leetcode.com_problems_binary-tree-level-order-traversal-ii]  
level 遍历变种： [http://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node/][http_oj.leetcode.com_problems_populating-next-right-pointers-in-each-node]  
level 遍历变种： [http://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/][http_oj.leetcode.com_problems_populating-next-right-pointers-in-each-node-ii]  
  
问题分析/智商/细节：  
[http://oj.leetcode.com/problems/single-number/][http_oj.leetcode.com_problems_single-number]  
[http://oj.leetcode.com/problems/single-number-ii/][http_oj.leetcode.com_problems_single-number-ii]  
[http://oj.leetcode.com/problems/candy/][http_oj.leetcode.com_problems_candy] ？  
[http://oj.leetcode.com/problems/gas-station/][http_oj.leetcode.com_problems_gas-station]  
  
动态规划：  
[http://oj.leetcode.com/problems/triangle/][http_oj.leetcode.com_problems_triangle] （最短路径）  
[http://oj.leetcode.com/problems/subsets/][http_oj.leetcode.com_problems_subsets] （另一种形式）  
[http://oj.leetcode.com/problems/subsets-ii/][http_oj.leetcode.com_problems_subsets-ii]  
[http://oj.leetcode.com/problems/edit-distance/][http_oj.leetcode.com_problems_edit-distance] （经典）  
[http://oj.leetcode.com/problems/word-break/][http_oj.leetcode.com_problems_word-break]  
[http://oj.leetcode.com/problems/word-break-ii/][http_oj.leetcode.com_problems_word-break-ii]  
[http://oj.leetcode.com/problems/unique-binary-search-trees/][http_oj.leetcode.com_problems_unique-binary-search-trees] （动态规划避免递归）  
[http://oj.leetcode.com/problems/unique-paths-ii/][http_oj.leetcode.com_problems_unique-paths-ii]  
[http://oj.leetcode.com/problems/scramble-string/][http_oj.leetcode.com_problems_scramble-string]  
[http://oj.leetcode.com/problems/palindrome-partitioning/][http_oj.leetcode.com_problems_palindrome-partitioning]  
[http://oj.leetcode.com/problems/palindrome-partitioning-ii/][http_oj.leetcode.com_problems_palindrome-partitioning-ii]  
[http://oj.leetcode.com/problems/interleaving-string/][http_oj.leetcode.com_problems_interleaving-string]  
[http://oj.leetcode.com/problems/distinct-subsequences/][http_oj.leetcode.com_problems_distinct-subsequences]  
[http://oj.leetcode.com/problems/decode-ways/][http_oj.leetcode.com_problems_decode-ways]  
[http://oj.leetcode.com/problems/gray-code/][http_oj.leetcode.com_problems_gray-code]  
[http://oj.leetcode.com/problems/minimum-path-sum/][http_oj.leetcode.com_problems_minimum-path-sum]  
  
回溯：  
[http://oj.leetcode.com/problems/combinations/][http_oj.leetcode.com_problems_combinations]  
[http://oj.leetcode.com/problems/generate-parentheses/][http_oj.leetcode.com_problems_generate-parentheses]  
[http://oj.leetcode.com/problems/combination-sum/][http_oj.leetcode.com_problems_combination-sum]  
[http://oj.leetcode.com/problems/combination-sum-ii/][http_oj.leetcode.com_problems_combination-sum-ii]  
[http://oj.leetcode.com/problems/sudoku-solver/][http_oj.leetcode.com_problems_sudoku-solver]  
经典N皇后： [http://oj.leetcode.com/problems/n-queens/][http_oj.leetcode.com_problems_n-queens]  
[http://oj.leetcode.com/problems/n-queens-ii/][http_oj.leetcode.com_problems_n-queens-ii]  
[http://oj.leetcode.com/problems/letter-combinations-of-a-phone-number/][http_oj.leetcode.com_problems_letter-combinations-of-a-phone-number]  
  
贪心：  
[http://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock/][http_oj.leetcode.com_problems_best-time-to-buy-and-sell-stock]  
[http://oj.leetcode.com/problems/jump-game/][http_oj.leetcode.com_problems_jump-game]  
[http://oj.leetcode.com/problems/jump-game-ii/][http_oj.leetcode.com_problems_jump-game-ii]  
[http://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/][http_oj.leetcode.com_problems_best-time-to-buy-and-sell-stock-ii]  
[http://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/][http_oj.leetcode.com_problems_best-time-to-buy-and-sell-stock-iii]  
[http://oj.leetcode.com/problems/maximum-subarray/][http_oj.leetcode.com_problems_maximum-subarray]  
[http://oj.leetcode.com/problems/minimum-window-substring/][http_oj.leetcode.com_problems_minimum-window-substring]  
[http://oj.leetcode.com/problems/maximal-rectangle/][http_oj.leetcode.com_problems_maximal-rectangle]  
[http://oj.leetcode.com/problems/longest-substring-without-repeating-characters/][http_oj.leetcode.com_problems_longest-substring-without-repeating-characters]  
  
分治 & 递归：  
[http://oj.leetcode.com/problems/unique-binary-search-trees-ii/][http_oj.leetcode.com_problems_unique-binary-search-trees-ii]  
[http://oj.leetcode.com/problems/restore-ip-addresses/][http_oj.leetcode.com_problems_restore-ip-addresses] （时间复杂度有限，递归满足）  
[http://oj.leetcode.com/problems/permutations/][http_oj.leetcode.com_problems_permutations]  
[http://oj.leetcode.com/problems/permutations-ii/][http_oj.leetcode.com_problems_permutations-ii]  
[http://oj.leetcode.com/problems/convert-sorted-array-to-binary-search-tree/][http_oj.leetcode.com_problems_convert-sorted-array-to-binary-search-tree]  
[http://oj.leetcode.com/problems/convert-sorted-list-to-binary-search-tree/][http_oj.leetcode.com_problems_convert-sorted-list-to-binary-search-tree]  
[http://oj.leetcode.com/problems/median-of-two-sorted-arrays/][http_oj.leetcode.com_problems_median-of-two-sorted-arrays]  
[http://oj.leetcode.com/problems/validate-binary-search-tree/][http_oj.leetcode.com_problems_validate-binary-search-tree]  
  
字符串：  
[http://oj.leetcode.com/problems/count-and-say/][http_oj.leetcode.com_problems_count-and-say]  
[http://oj.leetcode.com/problems/implement-strstr/][http_oj.leetcode.com_problems_implement-strstr] （子串查找）  
[http://oj.leetcode.com/problems/anagrams/][http_oj.leetcode.com_problems_anagrams]  
[http://oj.leetcode.com/problems/text-justification/][http_oj.leetcode.com_problems_text-justification] (细节）  
[http://oj.leetcode.com/problems/simplify-path/][http_oj.leetcode.com_problems_simplify-path] （基础控制语句 if-else-for）  
[http://oj.leetcode.com/problems/multiply-strings/][http_oj.leetcode.com_problems_multiply-strings]  
[http://oj.leetcode.com/problems/regular-expression-matching/][http_oj.leetcode.com_problems_regular-expression-matching]  
[http://oj.leetcode.com/problems/wildcard-matching/][http_oj.leetcode.com_problems_wildcard-matching]  
[http://oj.leetcode.com/problems/longest-palindromic-substring/][http_oj.leetcode.com_problems_longest-palindromic-substring]  
[http://oj.leetcode.com/problems/zigzag-conversion/][http_oj.leetcode.com_problems_zigzag-conversion]  
[http://oj.leetcode.com/problems/length-of-last-word/][http_oj.leetcode.com_problems_length-of-last-word]  
[http://oj.leetcode.com/problems/valid-palindrome/][http_oj.leetcode.com_problems_valid-palindrome]  
  
图：  
深搜/广搜： [http://oj.leetcode.com/problems/clone-graph/][http_oj.leetcode.com_problems_clone-graph]  
  
搜索 & 遍历：  
[http://oj.leetcode.com/problems/word-ladder/][http_oj.leetcode.com_problems_word-ladder]  
[http://oj.leetcode.com/problems/word-ladder-ii/][http_oj.leetcode.com_problems_word-ladder-ii]  
广搜： [http://oj.leetcode.com/problems/surrounded-regions/][http_oj.leetcode.com_problems_surrounded-regions]

[Link 1]: http://blog.csdn.net/samjustin1/article/details/52432865
[leetcode]: https://github.com/ghostrong/leetcode
[http_oj.leetcode.com_problems_evaluate-reverse-polish-notation]: http://oj.leetcode.com/problems/evaluate-reverse-polish-notation/
[http_oj.leetcode.com_problems_longest-valid-parentheses]: http://oj.leetcode.com/problems/longest-valid-parentheses/
[http_oj.leetcode.com_problems_valid-parentheses]: http://oj.leetcode.com/problems/valid-parentheses/
[http_oj.leetcode.com_problems_largest-rectangle-in-histogram]: http://oj.leetcode.com/problems/largest-rectangle-in-histogram/
[http_oj.leetcode.com_problems_trapping-rain-water]: http://oj.leetcode.com/problems/trapping-rain-water/
[http_oj.leetcode.com_problems_lru-cache]: http://oj.leetcode.com/problems/lru-cache/
[http_oj.leetcode.com_problems_substring-with-concatenation-of-all-words]: http://oj.leetcode.com/problems/substring-with-concatenation-of-all-words/
[http_oj.leetcode.com_problems_longest-consecutive-sequence]: http://oj.leetcode.com/problems/longest-consecutive-sequence/
[http_oj.leetcode.com_problems_longest-common-prefix]: http://oj.leetcode.com/problems/longest-common-prefix/
[http_oj.leetcode.com_problems_string-to-integer-atoi]: http://oj.leetcode.com/problems/string-to-integer-atoi/
[http_oj.leetcode.com_problems_search-a-2d-matrix]: http://oj.leetcode.com/problems/search-a-2d-matrix/
[http_oj.leetcode.com_problems_search-for-a-range]: http://oj.leetcode.com/problems/search-for-a-range/
[http_oj.leetcode.com_problems_sqrtx]: http://oj.leetcode.com/problems/sqrtx/
[http_oj.leetcode.com_problems_search-insert-position]: http://oj.leetcode.com/problems/search-insert-position/
[http_oj.leetcode.com_problems_search-in-rotated-sorted-array]: http://oj.leetcode.com/problems/search-in-rotated-sorted-array/
[http_oj.leetcode.com_problems_search-in-rotated-sorted-array-ii]: http://oj.leetcode.com/problems/search-in-rotated-sorted-array-ii/
[http_oj.leetcode.com_problems_pascals-triangle]: http://oj.leetcode.com/problems/pascals-triangle/
[http_oj.leetcode.com_problems_pascals-triangle-ii]: http://oj.leetcode.com/problems/pascals-triangle-ii/
[http_oj.leetcode.com_problems_powx-n]: http://oj.leetcode.com/problems/powx-n/
[http_oj.leetcode.com_problems_reverse-integer]: http://oj.leetcode.com/problems/reverse-integer/
[http_oj.leetcode.com_problems_plus-one]: http://oj.leetcode.com/problems/plus-one/
[http_oj.leetcode.com_problems_unique-paths]: http://oj.leetcode.com/problems/unique-paths/
[http_oj.leetcode.com_problems_palindrome-number]: http://oj.leetcode.com/problems/palindrome-number/
[http_oj.leetcode.com_problems_permutation-sequence]: http://oj.leetcode.com/problems/permutation-sequence/
[http_oj.leetcode.com_problems_merge-intervals]: http://oj.leetcode.com/problems/merge-intervals/
[http_oj.leetcode.com_problems_valid-number]: http://oj.leetcode.com/problems/valid-number/
[http_oj.leetcode.com_problems_climbing-stairs]: http://oj.leetcode.com/problems/climbing-stairs/
[http_oj.leetcode.com_problems_roman-to-integer]: http://oj.leetcode.com/problems/roman-to-integer/
[http_oj.leetcode.com_problems_integer-to-roman]: http://oj.leetcode.com/problems/integer-to-roman/
[http_oj.leetcode.com_problems_divide-two-integers]: http://oj.leetcode.com/problems/divide-two-integers/
[http_oj.leetcode.com_problems_insert-interval]: http://oj.leetcode.com/problems/insert-interval/
[http_oj.leetcode.com_problems_add-binary]: http://oj.leetcode.com/problems/add-binary/
[http_oj.leetcode.com_problems_add-two-numbers]: http://oj.leetcode.com/problems/add-two-numbers/
[http_oj.leetcode.com_problems_remove-element]: http://oj.leetcode.com/problems/remove-element/
[http_oj.leetcode.com_problems_merge-sorted-array]: http://oj.leetcode.com/problems/merge-sorted-array/
[http_oj.leetcode.com_problems_first-missing-positive]: http://oj.leetcode.com/problems/first-missing-positive/
[http_oj.leetcode.com_problems_spiral-matrix]: http://oj.leetcode.com/problems/spiral-matrix/
[http_oj.leetcode.com_problems_spiral-matrix-ii]: http://oj.leetcode.com/problems/spiral-matrix-ii/
[http_oj.leetcode.com_problems_rotate-image]: http://oj.leetcode.com/problems/rotate-image/
[http_oj.leetcode.com_problems_container-with-most-water]: http://oj.leetcode.com/problems/container-with-most-water/
[http_oj.leetcode.com_problems_two-sum]: http://oj.leetcode.com/problems/two-sum/
[http_oj.leetcode.com_problems_3sum]: http://oj.leetcode.com/problems/3sum/
[http_oj.leetcode.com_problems_3sum-closest]: http://oj.leetcode.com/problems/3sum-closest/
[http_oj.leetcode.com_problems_4sum]: http://oj.leetcode.com/problems/4sum/
[http_oj.leetcode.com_problems_set-matrix-zeroes]: http://oj.leetcode.com/problems/set-matrix-zeroes/
[http_oj.leetcode.com_problems_valid-sudoku]: http://oj.leetcode.com/problems/valid-sudoku/
[http_oj.leetcode.com_problems_next-permutation]: http://oj.leetcode.com/problems/next-permutation/
[http_oj.leetcode.com_problems_word-search]: http://oj.leetcode.com/problems/word-search/
[http_oj.leetcode.com_problems_remove-duplicates-from-sorted-array]: http://oj.leetcode.com/problems/remove-duplicates-from-sorted-array/
[http_oj.leetcode.com_problems_remove-duplicates-from-sorted-array-ii]: http://oj.leetcode.com/problems/remove-duplicates-from-sorted-array-ii/
[http_oj.leetcode.com_problems_sort-colors]: http://oj.leetcode.com/problems/sort-colors/
[http_oj.leetcode.com_problems_max-points-on-a-line]: http://oj.leetcode.com/problems/max-points-on-a-line/
[http_oj.leetcode.com_problems_sort-list]: http://oj.leetcode.com/problems/sort-list/
[http_oj.leetcode.com_problems_insertion-sort-list]: http://oj.leetcode.com/problems/insertion-sort-list/
[http_oj.leetcode.com_problems_reorder-list]: http://oj.leetcode.com/problems/reorder-list/
[http_oj.leetcode.com_problems_linked-list-cycle]: http://oj.leetcode.com/problems/linked-list-cycle/
[http_oj.leetcode.com_problems_linked-list-cycle-ii]: http://oj.leetcode.com/problems/linked-list-cycle-ii/
[http_oj.leetcode.com_problems_copy-list-with-random-pointer]: http://oj.leetcode.com/problems/copy-list-with-random-pointer/
[http_oj.leetcode.com_problems_rotate-list]: http://oj.leetcode.com/problems/rotate-list/
[http_oj.leetcode.com_problems_remove-duplicates-from-sorted-list]: http://oj.leetcode.com/problems/remove-duplicates-from-sorted-list/
[http_oj.leetcode.com_problems_remove-duplicates-from-sorted-list-ii]: http://oj.leetcode.com/problems/remove-duplicates-from-sorted-list-ii/
[http_oj.leetcode.com_problems_partition-list]: http://oj.leetcode.com/problems/partition-list/
[http_oj.leetcode.com_problems_swap-nodes-in-pairs]: http://oj.leetcode.com/problems/swap-nodes-in-pairs/
[http_oj.leetcode.com_problems_merge-two-sorted-lists]: http://oj.leetcode.com/problems/merge-two-sorted-lists/
[http_oj.leetcode.com_problems_merge-k-sorted-lists]: http://oj.leetcode.com/problems/merge-k-sorted-lists/
[http_oj.leetcode.com_problems_reverse-nodes-in-k-group]: http://oj.leetcode.com/problems/reverse-nodes-in-k-group/
[http_oj.leetcode.com_problems_remove-nth-node-from-end-of-list]: http://oj.leetcode.com/problems/remove-nth-node-from-end-of-list/
[http_oj.leetcode.com_problems_reverse-linked-list-ii]: http://oj.leetcode.com/problems/reverse-linked-list-ii/
[http_oj.leetcode.com_problems_same-tree]: http://oj.leetcode.com/problems/same-tree/
[http_oj.leetcode.com_problems_binary-tree-preorder-traversal]: http://oj.leetcode.com/problems/binary-tree-preorder-traversal/
[http_oj.leetcode.com_problems_binary-tree-inorder-traversal]: http://oj.leetcode.com/problems/binary-tree-inorder-traversal/
[http_oj.leetcode.com_problems_binary-tree-postorder-traversal]: http://oj.leetcode.com/problems/binary-tree-postorder-traversal/
[http_oj.leetcode.com_problems_sum-root-to-leaf-numbers]: http://oj.leetcode.com/problems/sum-root-to-leaf-numbers/
[http_oj.leetcode.com_problems_path-sum]: http://oj.leetcode.com/problems/path-sum/
[http_oj.leetcode.com_problems_path-sum-ii]: http://oj.leetcode.com/problems/path-sum-ii/
[http_oj.leetcode.com_problems_maximum-depth-of-binary-tree]: http://oj.leetcode.com/problems/maximum-depth-of-binary-tree/
[http_oj.leetcode.com_problems_minimum-depth-of-binary-tree]: http://oj.leetcode.com/problems/minimum-depth-of-binary-tree/
[http_oj.leetcode.com_problems_construct-binary-tree-from-preorder-and-inorder-traversal]: http://oj.leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
[http_oj.leetcode.com_problems_construct-binary-tree-from-inorder-and-postorder-traversal]: http://oj.leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/
[http_oj.leetcode.com_problems_binary-tree-zigzag-level-order-traversal]: http://oj.leetcode.com/problems/binary-tree-zigzag-level-order-traversal/
[http_oj.leetcode.com_problems_symmetric-tree]: http://oj.leetcode.com/problems/symmetric-tree/
[http_oj.leetcode.com_problems_binary-tree-maximum-path-sum]: http://oj.leetcode.com/problems/binary-tree-maximum-path-sum/
[http_oj.leetcode.com_problems_balanced-binary-tree]: http://oj.leetcode.com/problems/balanced-binary-tree/
[http_oj.leetcode.com_problems_recover-binary-search-tree]: http://oj.leetcode.com/problems/recover-binary-search-tree/
[http_oj.leetcode.com_problems_flatten-binary-tree-to-linked-list]: http://oj.leetcode.com/problems/flatten-binary-tree-to-linked-list/
[http_oj.leetcode.com_problems_binary-tree-level-order-traversal]: http://oj.leetcode.com/problems/binary-tree-level-order-traversal/
[http_oj.leetcode.com_problems_binary-tree-level-order-traversal-ii]: http://oj.leetcode.com/problems/binary-tree-level-order-traversal-ii/
[http_oj.leetcode.com_problems_populating-next-right-pointers-in-each-node]: http://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node/
[http_oj.leetcode.com_problems_populating-next-right-pointers-in-each-node-ii]: http://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/
[http_oj.leetcode.com_problems_single-number]: http://oj.leetcode.com/problems/single-number/
[http_oj.leetcode.com_problems_single-number-ii]: http://oj.leetcode.com/problems/single-number-ii/
[http_oj.leetcode.com_problems_candy]: http://oj.leetcode.com/problems/candy/
[http_oj.leetcode.com_problems_gas-station]: http://oj.leetcode.com/problems/gas-station/
[http_oj.leetcode.com_problems_triangle]: http://oj.leetcode.com/problems/triangle/
[http_oj.leetcode.com_problems_subsets]: http://oj.leetcode.com/problems/subsets/
[http_oj.leetcode.com_problems_subsets-ii]: http://oj.leetcode.com/problems/subsets-ii/
[http_oj.leetcode.com_problems_edit-distance]: http://oj.leetcode.com/problems/edit-distance/
[http_oj.leetcode.com_problems_word-break]: http://oj.leetcode.com/problems/word-break/
[http_oj.leetcode.com_problems_word-break-ii]: http://oj.leetcode.com/problems/word-break-ii/
[http_oj.leetcode.com_problems_unique-binary-search-trees]: http://oj.leetcode.com/problems/unique-binary-search-trees/
[http_oj.leetcode.com_problems_unique-paths-ii]: http://oj.leetcode.com/problems/unique-paths-ii/
[http_oj.leetcode.com_problems_scramble-string]: http://oj.leetcode.com/problems/scramble-string/
[http_oj.leetcode.com_problems_palindrome-partitioning]: http://oj.leetcode.com/problems/palindrome-partitioning/
[http_oj.leetcode.com_problems_palindrome-partitioning-ii]: http://oj.leetcode.com/problems/palindrome-partitioning-ii/
[http_oj.leetcode.com_problems_interleaving-string]: http://oj.leetcode.com/problems/interleaving-string/
[http_oj.leetcode.com_problems_distinct-subsequences]: http://oj.leetcode.com/problems/distinct-subsequences/
[http_oj.leetcode.com_problems_decode-ways]: http://oj.leetcode.com/problems/decode-ways/
[http_oj.leetcode.com_problems_gray-code]: http://oj.leetcode.com/problems/gray-code/
[http_oj.leetcode.com_problems_minimum-path-sum]: http://oj.leetcode.com/problems/minimum-path-sum/
[http_oj.leetcode.com_problems_combinations]: http://oj.leetcode.com/problems/combinations/
[http_oj.leetcode.com_problems_generate-parentheses]: http://oj.leetcode.com/problems/generate-parentheses/
[http_oj.leetcode.com_problems_combination-sum]: http://oj.leetcode.com/problems/combination-sum/
[http_oj.leetcode.com_problems_combination-sum-ii]: http://oj.leetcode.com/problems/combination-sum-ii/
[http_oj.leetcode.com_problems_sudoku-solver]: http://oj.leetcode.com/problems/sudoku-solver/
[http_oj.leetcode.com_problems_n-queens]: http://oj.leetcode.com/problems/n-queens/
[http_oj.leetcode.com_problems_n-queens-ii]: http://oj.leetcode.com/problems/n-queens-ii/
[http_oj.leetcode.com_problems_letter-combinations-of-a-phone-number]: http://oj.leetcode.com/problems/letter-combinations-of-a-phone-number/
[http_oj.leetcode.com_problems_best-time-to-buy-and-sell-stock]: http://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock/
[http_oj.leetcode.com_problems_jump-game]: http://oj.leetcode.com/problems/jump-game/
[http_oj.leetcode.com_problems_jump-game-ii]: http://oj.leetcode.com/problems/jump-game-ii/
[http_oj.leetcode.com_problems_best-time-to-buy-and-sell-stock-ii]: http://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
[http_oj.leetcode.com_problems_best-time-to-buy-and-sell-stock-iii]: http://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/
[http_oj.leetcode.com_problems_maximum-subarray]: http://oj.leetcode.com/problems/maximum-subarray/
[http_oj.leetcode.com_problems_minimum-window-substring]: http://oj.leetcode.com/problems/minimum-window-substring/
[http_oj.leetcode.com_problems_maximal-rectangle]: http://oj.leetcode.com/problems/maximal-rectangle/
[http_oj.leetcode.com_problems_longest-substring-without-repeating-characters]: http://oj.leetcode.com/problems/longest-substring-without-repeating-characters/
[http_oj.leetcode.com_problems_unique-binary-search-trees-ii]: http://oj.leetcode.com/problems/unique-binary-search-trees-ii/
[http_oj.leetcode.com_problems_restore-ip-addresses]: http://oj.leetcode.com/problems/restore-ip-addresses/
[http_oj.leetcode.com_problems_permutations]: http://oj.leetcode.com/problems/permutations/
[http_oj.leetcode.com_problems_permutations-ii]: http://oj.leetcode.com/problems/permutations-ii/
[http_oj.leetcode.com_problems_convert-sorted-array-to-binary-search-tree]: http://oj.leetcode.com/problems/convert-sorted-array-to-binary-search-tree/
[http_oj.leetcode.com_problems_convert-sorted-list-to-binary-search-tree]: http://oj.leetcode.com/problems/convert-sorted-list-to-binary-search-tree/
[http_oj.leetcode.com_problems_median-of-two-sorted-arrays]: http://oj.leetcode.com/problems/median-of-two-sorted-arrays/
[http_oj.leetcode.com_problems_validate-binary-search-tree]: http://oj.leetcode.com/problems/validate-binary-search-tree/
[http_oj.leetcode.com_problems_count-and-say]: http://oj.leetcode.com/problems/count-and-say/
[http_oj.leetcode.com_problems_implement-strstr]: http://oj.leetcode.com/problems/implement-strstr/
[http_oj.leetcode.com_problems_anagrams]: http://oj.leetcode.com/problems/anagrams/
[http_oj.leetcode.com_problems_text-justification]: http://oj.leetcode.com/problems/text-justification/
[http_oj.leetcode.com_problems_simplify-path]: http://oj.leetcode.com/problems/simplify-path/
[http_oj.leetcode.com_problems_multiply-strings]: http://oj.leetcode.com/problems/multiply-strings/
[http_oj.leetcode.com_problems_regular-expression-matching]: http://oj.leetcode.com/problems/regular-expression-matching/
[http_oj.leetcode.com_problems_wildcard-matching]: http://oj.leetcode.com/problems/wildcard-matching/
[http_oj.leetcode.com_problems_longest-palindromic-substring]: http://oj.leetcode.com/problems/longest-palindromic-substring/
[http_oj.leetcode.com_problems_zigzag-conversion]: http://oj.leetcode.com/problems/zigzag-conversion/
[http_oj.leetcode.com_problems_length-of-last-word]: http://oj.leetcode.com/problems/length-of-last-word/
[http_oj.leetcode.com_problems_valid-palindrome]: http://oj.leetcode.com/problems/valid-palindrome/
[http_oj.leetcode.com_problems_clone-graph]: http://oj.leetcode.com/problems/clone-graph/
[http_oj.leetcode.com_problems_word-ladder]: http://oj.leetcode.com/problems/word-ladder/
[http_oj.leetcode.com_problems_word-ladder-ii]: http://oj.leetcode.com/problems/word-ladder-ii/
[http_oj.leetcode.com_problems_surrounded-regions]: http://oj.leetcode.com/problems/surrounded-regions/