update repo

.github/ISSUE_TEMPLATE/daily-problem.md

@@ -0,0 +1,12 @@
+---
+name: Daily Problem
+about: Contribute Daily Problem
+title: "【每日一题】- 2020-xx-xx - xxx "
+labels: Daily Question
+assignees: ''
+
+---
+
+[anything]
+
+题目地址：xxxxxx

.github/ISSUE_TEMPLATE/translation.md

@@ -0,0 +1,10 @@
+---
+name: Translation
+about: translation
+title: 'feat(translation): xxxxxxx'
+labels: 国际化
+assignees: ''
+
+---
+
+

CONTRIBUTING.en.md

@@ -0,0 +1,23 @@
+# Contributing
+
+## Translation
+
+Please pick any work without translation by `submit new issue`. English version and Chinese version are distinguished by file name, e.g. Chinese version file name abc.md, the corresponding English version should be abc.en.md. 
+
+Manual translation instead of machine translation, there is no need to translate the technical jargon.
+
+## Contributing to problems
+
+Please follow the template of "problems", what you need to submit are:
+
+- Problem and solution markdown file
+- Add the link of the solution in README.md
+- Add the link of the solution in README.en.md (optional)
+- draw.io file(xml) or pictures (optional)
+
+> Template for reference: [1014.best-sightseeing-pair](./templates/problems/1014.best-sightseeing-pair.md)
+> Online painting tools like https://excalidraw.com/, draw.io, processon or iPad apps
+
+## Contributing to daily problem
+
+- Please follow the template of "daily problem" and submit the issue with correct tags (can refer to official tags on LeetCode).

CONTRIBUTING.md

@@ -2,7 +2,7 @@
 
 ## 翻译
 
-只需要看哪个没有被翻译即可认领，认领方式为`提交新的issue`形式。英文版本和中文版通过文件名区分。比如中文的文件名是abc.md，那么英文的应该是abc.en.md。
+只需要看哪个没有被翻译即可认领，认领方式为`提交新的issue`形式。英文版本和中文版通过文件名区分。比如中文的文件名是 abc.md，那么英文的应该是 abc.en.md。
 
 尽可能使用意译，避免机械性的英文翻译，专有名词无需翻译。
 
@@ -15,6 +15,9 @@
 - README.en.md （如果你是英文题解的话）
 - drawio 文件 或者图片（如果你画图的话）
 
+> 模板可参考 [1014.best-sightseeing-pair](./templates/problems/1014.best-sightseeing-pair.md)
+> 也可以使用其他画图工具，比如 https://excalidraw.com/ 或者 draw.io 或者 processon 或者 ipad 画图
+
 ## 贡献每日一题
 
-- 直接按照“每日一题”格式要求提交issue即可，需要注意的是，要打上正确的tag，如果LeetCode题目，可以参考官方给的tag。
+- 直接按照“每日一题”格式要求提交 issue 即可，需要注意的是，要打上正确的 tag，如果 LeetCode 题目，可以参考官方给的 tag。

assets/drawio/208.implement-trie-prefix-tree.en.drawio

@@ -0,0 +1 @@
+<mxfile host="app.diagrams.net" modified="2020-07-14T05:44:32.784Z" agent="5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/83.0.4103.116 Safari/537.36" etag="spOGC2PEA06TpGs6OMPO" version="13.4.2" type="device"><diagram id="zUBkOizd3lOV14bIgwrr" name="Page-1">7Ztdj6M2FIZ/TS4bgc1HcjlJN7sXXXWrqTSXKy92AlqDqe1sMv31tYMhgMkOVQlEHRJpEr824HkfsA/HZAG36fkjR3n8mWFCF8DB5wX8dQHA2nfVXy28FoIXrgvhwBNcSO5VeE7+JkZ0jHpMMBGNhpIxKpO8KUYsy0gkGxrinJ2azfaMNo+aowOxhOcIUVt9SbCMC3XlO1f9E0kOcXlk1zE1KSobG0HECLNTTYIfFnDLGZPFt/S8JVR7V/pSbLe7UVt1jJNM9tngS/r8SYT+6Y/Njx14kfj3z3j1Cyj28gPRo/mHTWfla+mA2osyWxU2pziR5DlHka45KdxKi2VKVclVX5HICwL75EzUQTdm34RLcr7ZabeyQp1ChKVE8lfVxGzgrY175vRxA1M+XWGUUlzjUGrI4D9Ue746pL4Yk/6FYdAyDD2YY6DpGPAmdsyzHMsfyzEYNB2D7sSO+Q/vmNtybDWxY4HlGH0wx8KmY97U41hoOUYezLHWOObDiR1bvT1VVlO8ozzASMTajEuhZpaQnH0nW0YZV0rGMm0wRd8I/cJEIhOWKTlSLhFVv9EeJioc+a3V4BuTkqW1Bk80OegKyTQcZErVflTXct3L9HzQcdoyFREiS0xyTiIkCV7mTKiWXy8xk2q/Tygt+7gA0HE2252iteFMItMFCAaasVrXBugYf0EHaf9epNcz6TuRbs0boGPeGJV02Z8Z9dCood8KEfypUbsz6hbqwVi3AmjP9Sdm3eO29p2xvhNq35katX1DnogXxrHSFvBJp4v40Q5tlQOyFcO2KbRhpQnG9FYwzNkxw9UZtGeZrAHZ7bwnEBjdpLjccBggALZvxWwgVU5qHCL2Df+7JuLDyYnYCYUWkT2i4n+MxGuNWqAjGHHhqEjsjMX7QlKNU1XSreMqGReJnRJ5X0g8pxXGBZMj6ZFzeTPoqoHpjr+KIK9c3QEdARglKPuaojxPssMyP4r4Gnq1MNzChRMVu5menYiQwxALVk1ibthzqoF3I9YjdzITq89EUxMDPVIgM7HaRAUmJ9YjkzETq81jTke0Ny6xHvmImViN2OTzGLDTCjOxnxDzvcmJ2WkH10Jmx+rNDJ8yLri87Kza3tfvAaN7922IxWsYYqvWeqrbsfbidQADdwNmZyXsa2wGdg0VOx4ZGBeYnbOAM7DbwGDHEwvjArMzGt4M7DYwr2MxY1xgdr7Dn4H9BNjkc5id7ghmYLeBdYWJowIrh+Q5ru/3hE7Q8fTwuHE97Mp2BFQaaxb60f/SneCvIyuMgOsQO2FYl4KD/vwzJgvzywD1yfWaulDeCFWQl6qcs4gIXWZ7LXKkDBUKU9UiOvKLncDJGNbCXh2+qmSqUuQsw8UmUYw4itQ1uyx7rVwoOl50qMdwMfR6wsDrBj7w3zxnYHlH/x+vclW8/mLiUlf72Qn88A8=</diagram></mxfile>

collections/easy.md

@@ -0,0 +1,36 @@
+- [0001.two-sum](../problems/1.two-sum.md)
+- [0020.Valid Parentheses](../problems/20.valid-parentheses.md)
+- [0021.MergeTwoSortedLists](../problems/21.merge-two-sorted-lists.md)
+- [0026.remove-duplicates-from-sorted-array](../problems/26.remove-duplicates-from-sorted-array.md)
+- [0053.maximum-sum-subarray](../problems/53.maximum-sum-subarray-cn.md)
+- [0088.merge-sorted-array](../problems/88.merge-sorted-array.md)
+- [0101.symmetric-tree](../problems/101.symmetric-tree.md)🆕
+- [0104.maximum-depth-of-binary-tree](../problems/104.maximum-depth-of-binary-tree.md)
+- [0108.convert-sorted-array-to-binary-search-tree](../problems/108.convert-sorted-array-to-binary-search-tree.md)
+- [0121.best-time-to-buy-and-sell-stock](../problems/121.best-time-to-buy-and-sell-stock.md)
+- [0122.best-time-to-buy-and-sell-stock-ii](../problems/122.best-time-to-buy-and-sell-stock-ii.md)
+- [0125.valid-palindrome](../problems/125.valid-palindrome.md)
+- [0136.single-number](../problems/136.single-number.md)
+- [0155.min-stack](../problems/155.min-stack.md) 🆕
+- [0167.two-sum-ii-input-array-is-sorted](../problems/167.two-sum-ii-input-array-is-sorted.md)
+- [0169.majority-element](../problems/169.majority-element.md)
+- [0172.factorial-trailing-zeroes](../problems/172.factorial-trailing-zeroes.md)
+- [0190.reverse-bits](../problems/190.reverse-bits.md)
+- [0191.number-of-1-bits](../problems/191.number-of-1-bits.md)
+- [0198.house-robber](../problems/198.house-robber.md)
+- [0203.remove-linked-list-elements](../problems/203.remove-linked-list-elements.md)
+- [0206.reverse-linked-list](../problems/206.reverse-linked-list.md)
+- [0219.contains-duplicate-ii](../problems/219.contains-duplicate-ii.md)
+- [0226.invert-binary-tree](../problems/226.invert-binary-tree.md)
+- [0232.implement-queue-using-stacks](../problems/232.implement-queue-using-stacks.md) 🆕
+- [0263.ugly-number](../problems/263.ugly-number.md)
+- [0283.move-zeroes](../problems/283.move-zeroes.md)
+- [0342.power-of-four](../problems/342.power-of-four.md)
+- [0349.intersection-of-two-arrays](../problems/349.intersection-of-two-arrays.md)
+- [0371.sum-of-two-integers](../problems/371.sum-of-two-integers.md)
+- [0437.path-sum-iii](../problems/437.path-sum-iii.md) 🆕
+- [0455.AssignCookies](../problems/455.AssignCookies.md) 🆕
+- [0575.distribute-candies](../problems/575.distribute-candies.md)
+- [0874.walking-robot-simulation](../problems/874.walking-robot-simulation.md) 🆕
+- [1260.shift-2d-grid](../problems/1260.shift-2d-grid.md) 🆕
+- [1332.remove-palindromic-subsequences](../problems/1332.remove-palindromic-subsequences.md) 🆕

collections/hard.md

@@ -0,0 +1,27 @@
+- [0004.median-of-two-sorted-array](../problems/4.median-of-two-sorted-arrays.md)
+- [0023.merge-k-sorted-lists](../problems/23.merge-k-sorted-lists.md)
+- [0025.reverse-nodes-in-k-group](../problems/25.reverse-nodes-in-k-groups-cn.md)
+- [0030.substring-with-concatenation-of-all-words](../problems/30.substring-with-concatenation-of-all-words.md)
+- [0032.longest-valid-parentheses](../problems/32.longest-valid-parentheses.md)
+- [0042.trapping-rain-water](../problems/42.trapping-rain-water.md)🖊
+- [0052.N-Queens-II](../problems/52.N-Queens-II.md)
+- [0084.largest-rectangle-in-histogram](../problems/84.largest-rectangle-in-histogram.md)
+- [0085.maximal-rectangle](../problems/85.maximal-rectangle.md)
+- [0124.binary-tree-maximum-path-sum](../problems/124.binary-tree-maximum-path-sum.md)
+- [0128.longest-consecutive-sequence](../problems/128.longest-consecutive-sequence.md)
+- [0145.binary-tree-postorder-traversal](../problems/145.binary-tree-postorder-traversal.md)
+- [0212.word-search-ii](../problems/212.word-search-ii.md)
+- [0239.sliding-window-maximum](../problems/239.sliding-window-maximum.md)
+- [0295.find-median-from-data-stream](../problems/295.find-median-from-data-stream.md)
+- [0301.remove-invalid-parentheses](../problems/301.remove-invalid-parentheses.md)
+- [0312.burst-balloons](../problems/312.burst-balloons.md) 🆕
+- [0335.self-crossPing](../problems/335.self-crossing.md)
+- [0460.lfu-cache](../problems/460.lfu-cache.md)
+- [0472.concatenated-words](../problems/472.concatenated-words.md) 🆕
+- [0493.reverse-pairs](../problems/493.reverse-pairs.md) 🆕
+- [0887.super-egg-drop](../problems/887.super-egg-drop.md)
+- [0895.maximum-frequency-stack](../problems/895.maximum-frequency-stack.md) 🆕
+
+- [1032.stream-of-characters](../problems/1032.stream-of-characters.md) 🆕
+- [1168.optimize-water-distribution-in-a-village](../problems/1168.optimize-water-distribution-in-a-village-cn.md) 🆕
+- [1449.form-largest-integer-with-digits-that-add-up-to-target](../problems/1449.form-largest-integer-with-digits-that-add-up-to-target.md) 🆕

collections/medium.md

@@ -0,0 +1,108 @@
+- [0002.add-two-numbers](../problems/2.add-two-numbers.md)
+- [0003.longest-substring-without-repeating-characters](../problems/3.longest-substring-without-repeating-characters.md)
+- [0005.longest-palindromic-substring](../problems/5.longest-palindromic-substring.md)
+- [0011.container-with-most-water](../problems/11.container-with-most-water.md)
+- [0015.3-sum](../problems/15.3sum.md)
+- [0017.Letter-Combinations-of-a-Phone-Number](../problems/17.Letter-Combinations-of-a-Phone-Number.md) 🆕
+- [0019. Remove Nth Node From End of List](../problems/19.removeNthNodeFromEndofList.md)
+- [0022.generate-parentheses.md](../problems/22.generate-parentheses.md) 🆕
+- [0024. Swap Nodes In Pairs](../problems/24.swapNodesInPairs.md)
+- [0029.divide-two-integers](../problems/29.divide-two-integers.md)
+- [0031.next-permutation](../problems/31.next-permutation.md)
+- [0033.search-in-rotated-sorted-array](../problems/33.search-in-rotated-sorted-array.md)
+- [0039.combination-sum](../problems/39.combination-sum.md)
+- [0040.combination-sum-ii](../problems/40.combination-sum-ii.md)
+- [0046.permutations](../problems/46.permutations.md)
+- [0047.permutations-ii](../problems/47.permutations-ii.md)
+- [0048.rotate-image](../problems/48.rotate-image.md)
+- [0049.group-anagrams](../problems/49.group-anagrams.md)
+- [0050.pow-x-n](../problems/50.pow-x-n.md) 🆕
+- [0055.jump-game](../problems/55.jump-game.md)
+- [0056.merge-intervals](../problems/56.merge-intervals.md)
+- [0060.permutation-sequence](../problems/60.permutation-sequence.md) 🆕
+- [0062.unique-paths](../problems/62.unique-paths.md) 🖊
+- [0073.set-matrix-zeroes](../problems/73.set-matrix-zeroes.md)
+- [0075.sort-colors](../problems/75.sort-colors.md)
+- [0078.subsets](../problems/78.subsets.md)
+- [0079.word-search](../problems/79.word-search-en.md)
+- [0080.remove-duplicates-from-sorted-array-ii](../problems/80.remove-duplicates-from-sorted-array-ii.md) 🆕
+- [0086.partition-list](../problems/86.partition-list.md)
+- [0090.subsets-ii](../problems/90.subsets-ii.md)
+- [0091.decode-ways](../problems/91.decode-ways.md)
+- [0092.reverse-linked-list-ii](../problems/92.reverse-linked-list-ii.md) 🖊
+- [0094.binary-tree-inorder-traversal](../problems/94.binary-tree-inorder-traversal.md)
+- [0095.unique-binary-search-trees-ii](../problems/95.unique-binary-search-trees-ii.md) 🆕
+- [0096.unique-binary-search-trees](../problems/96.unique-binary-search-trees.md) 🆕
+- [0098.validate-binary-search-tree](../problems/98.validate-binary-search-tree.md)
+- [0102.binary-tree-level-order-traversal](../problems/102.binary-tree-level-order-traversal.md)
+- [0103.binary-tree-zigzag-level-order-traversal](../problems/103.binary-tree-zigzag-level-order-traversal.md)
+- [105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md](../problems/105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md)
+- [0113.path-sum-ii](../problems/113.path-sum-ii.md)
+- [0129.sum-root-to-leaf-numbers](../problems/129.sum-root-to-leaf-numbers.md)
+- [0130.surrounded-regions](../problems/130.surrounded-regions.md)
+- [0131.palindrome-partitioning](../problems/131.palindrome-partitioning.md)
+- [0139.word-break](../problems/139.word-break.md)
+- [0144.binary-tree-preorder-traversal](../problems/144.binary-tree-preorder-traversal.md)
+- [0150.evaluate-reverse-polish-notation](../problems/150.evaluate-reverse-polish-notation.md)
+- [0152.maximum-product-subarray](../problems/152.maximum-product-subarray.md) 🖊
+- [0199.binary-tree-right-side-view](../problems/199.binary-tree-right-side-view.md)
+- [0200.number-of-islands](../problems/200.number-of-islands.md) 🆕
+- [0201.bitwise-and-of-numbers-range](../problems/201.bitwise-and-of-numbers-range.md) 🖊
+- [0208.implement-trie-prefix-tree](../problems/208.implement-trie-prefix-tree.md)
+- [0209.minimum-size-subarray-sum](../problems/209.minimum-size-subarray-sum.md)
+- [0211.add-and-search-word-data-structure-design](../problems/211.add-and-search-word-data-structure-design.md) 🆕
+- [0215.kth-largest-element-in-an-array](../problems/215.kth-largest-element-in-an-array.md) 🆕
+- [0221.maximal-square](../problems/221.maximal-square.md)
+- [0229.majority-element-ii](../problems/229.majority-element-ii.md) 🆕
+- [0230.kth-smallest-element-in-a-bst](../problems/230.kth-smallest-element-in-a-bst.md)
+- [0236.lowest-common-ancestor-of-a-binary-tree](../problems/236.lowest-common-ancestor-of-a-binary-tree.md)
+- [0238.product-of-array-except-self](../problems/238.product-of-array-except-self.md)
+- [0240.search-a-2-d-matrix-ii](../problems/240.search-a-2-d-matrix-ii.md)
+- [0279.perfect-squares](../problems/279.perfect-squares.md)
+- [0309.best-time-to-buy-and-sell-stock-with-cooldown](../problems/309.best-time-to-buy-and-sell-stock-with-cooldown.md)
+- [0322.coin-change](../problems/322.coin-change.md)
+- [0328.odd-even-linked-list](../problems/328.odd-even-linked-list.md)
+- [0334.increasing-triplet-subsequence](../problems/334.increasing-triplet-subsequence.md)
+- [0337.house-robber-iii.md](../problems/337.house-robber-iii.md)
+- [0343.integer-break](../problems/343.integer-break.md)🆕
+- [0365.water-and-jug-problem](../problems/365.water-and-jug-problem.md)
+- [0378.kth-smallest-element-in-a-sorted-matrix](../problems/378.kth-smallest-element-in-a-sorted-matrix.md)
+- [0380.insert-delete-getrandom-o1](../problems/380.insert-delete-getrandom-o1.md)
+- [0416.partition-equal-subset-sum](../problems/416.partition-equal-subset-sum.md)🖊
+- [0445.add-two-numbers-ii](../problems/445.add-two-numbers-ii.md)
+- [0454.4-sum-ii](../problems/454.4-sum-ii.md)
+- [0474.ones-and-zeros](../problems/474.ones-and-zeros-en.md)
+- [0494.target-sum](../problems/494.target-sum.md)
+- [0516.longest-palindromic-subsequence](../problems/516.longest-palindromic-subsequence.md)
+- [0518.coin-change-2](../problems/518.coin-change-2.md)
+- [0547.friend-circles](../problems/547.friend-circles-en.md)
+- [0560.subarray-sum-equals-k](../problems/560.subarray-sum-equals-k.md)
+- [0609.find-duplicate-file-in-system](../problems/609.find-duplicate-file-in-system.md)
+- [0611.valid-triangle-number](../problems/611.valid-triangle-number.md)
+- [0718.maximum-length-of-repeated-subarray](../problems/718.maximum-length-of-repeated-subarray.md)
+- [0785.is-graph-bipartite](../problems/785.is-graph-bipartite.md) 🆕
+- [0820.short-encoding-of-words](../problems/820.short-encoding-of-words.md) 🖊
+- [0875.koko-eating-bananas](../problems/875.koko-eating-bananas.md)
+- [0877.stone-game](../problems/877.stone-game.md)
+- [0886.possible-bipartition](../problems/886.possible-bipartition.md) 🆕
+- [0900.rle-iterator](../problems/900.rle-iterator.md)
+- [0912.sort-an-array](../problems/912.sort-an-array.md)
+- [0935.knight-dialer](../problems/935.knight-dialer.md) 🆕
+- [1011.capacity-to-ship-packages-within-d-days](../problems/1011.capacity-to-ship-packages-within-d-days.md)
+- [1014.best-sightseeing-pair](../problems/1014.best-sightseeing-pair.md) 🆕
+- [1015.smallest-integer-divisible-by-k](../problems/1015.smallest-integer-divisible-by-k.md)
+- [1019.next-greater-node-in-linked-list](../problems/1019.next-greater-node-in-linked-list.md) 🆕
+- [1020.number-of-enclaves](../problems/1020.number-of-enclaves.md)
+- [1023.camelcase-matching](../problems/1023.camelcase-matching.md)
+- [1031.maximum-sum-of-two-non-overlapping-subarrays](../problems/1031.maximum-sum-of-two-non-overlapping-subarrays.md)
+- [1104.path-in-zigzag-labelled-binary-tree](../problems/1104.path-in-zigzag-labelled-binary-tree.md)
+- [1131.maximum-of-absolute-value-expression](../problems/1131.maximum-of-absolute-value-expression.md)
+- [1186.maximum-subarray-sum-with-one-deletion](../problems/1186.maximum-subarray-sum-with-one-deletion.md) 🆕
+- [1218.longest-arithmetic-subsequence-of-given-difference](../problems/1218.longest-arithmetic-subsequence-of-given-difference.md)
+- [1227.airplane-seat-assignment-probability](../problems/1227.airplane-seat-assignment-probability.md)
+- [1261.find-elements-in-a-contaminated-binary-tree](../problems/1261.find-elements-in-a-contaminated-binary-tree.md)
+- [1262.greatest-sum-divisible-by-three](../problems/1262.greatest-sum-divisible-by-three.md)
+- [1297.maximum-number-of-occurrences-of-a-substring](../problems/1297.maximum-number-of-occurrences-of-a-substring.md)
+- [1310.xor-queries-of-a-subarray](../problems/1310.xor-queries-of-a-subarray.md) 🆕
+- [1334.find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](../problems/1334.find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.md) 🆕
+- [1371.find-the-longest-substring-containing-vowels-in-even-counts](../problems/1371.find-the-longest-substring-containing-vowels-in-even-counts.md) 🆕

daily/2019-06-27.md

@@ -52,7 +52,7 @@ function sqrt(num) {
 也就是说，函数上任一点(x,f(x))处的切线斜率是2x。
 那么，x-f(x)/(2x)就是一个比x更接近的近似值。代入 f(x)=x^2-a得到x-(x^2-a)/(2x)，也就是(x+a/x)/2。
 
-![2019-06-27](../assets/daily/2019-06-27.gif)
+![2019-06-27](https://tva1.sinaimg.cn/large/007S8ZIlly1ghludzm5xsg30ip0dct9s.gif)
 
 (图片来自Wikipedia)
 

daily/2019-07-10.md

@@ -28,7 +28,7 @@
 
 这个题目解释起来比较费劲，我在网上找了一个现成的图来解释一下：
 
-![weight-ball](../assets/daily/weight-ball.jpg)
+![weight-ball](https://tva1.sinaimg.cn/large/007S8ZIlly1ghlue317j6j30d80dcta4.jpg)
 
 图中“1+”是指“1号小球为重”这一可能性。“1-”是指“1号小球为轻”这一可能性。
 一开始一共有24种可能性。

daily/2019-07-23.md

@@ -14,7 +14,7 @@
 
 ```
 
-![2019-07-23](../assets/daily/2019-07-23.jpeg)
+![2019-07-23](https://tva1.sinaimg.cn/large/007S8ZIlly1ghludxwb1aj30py1hc0tr.jpg)
 
 ## 参考答案
 

daily/2019-07-26.md

@@ -8,7 +8,7 @@
 
 ## 题目描述
 
-![2019-07-26](../assets/daily/2019-07-26.jpeg)
+![2019-07-26](https://tva1.sinaimg.cn/large/007S8ZIlly1ghludytrtlj30py1hcas1.jpg)
 
 ## 参考答案
 

daily/2019-07-29.md

@@ -37,7 +37,7 @@ Example 2:
 2. row->col、col->row 的切换都伴随读取的初始位置的变化；
 3. 结束条件是row头>row尾或者col顶>col底
 
-![剥洋葱](../assets/problems/54.spiral-matrix.jpg)
+![剥洋葱](https://tva1.sinaimg.cn/large/007S8ZIlly1ghlue0ni96j30b00bdq35.jpg)
 
 时间复杂度O(m*n), 空间复杂度O(1)
 

daily/2019-07-30.md

@@ -22,7 +22,7 @@
 那么沿着这条纬线（记为E纬线）上任意一点向东走一英里，始终会回到原点，只是走的圈数不同而已。
 根据题目倒推，在这条纬线以北一英里存在一条纬线（记为N纬线），从N纬线的任意一点向南一英里到达E纬线W点，沿着E纬线向东一英里，必会回到W点，再向北走一英里恰好可以回到起点。北极点可能包含在这个集合中，也可能不在。
 如下图示供参考：
-![earth-problem](../assets/daily/2019-07-30.jpg)
+![earth-problem](https://tva1.sinaimg.cn/large/007S8ZIlly1ghlue5gt6uj30u01441l0.jpg)
 
 所以答案是无数个点