添加内容

leetcode/0004.Median-of-Two-Sorted-Arrays/README.md

@@ -1,7 +1,7 @@
 # [4. Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)
 
 
-## 题目:
+## 题目
 
 There are two sorted arrays **nums1** and **nums2** of size m and n respectively.
 

leetcode/0007.Reverse-Integer/README.md

@@ -1,7 +1,7 @@
 # [7. Reverse Integer](https://leetcode.com/problems/reverse-integer/)
 
 
-## 题目:
+## 题目
 
 Given a 32-bit signed integer, reverse digits of an integer.
 

leetcode/0017.Letter-Combinations-of-a-Phone-Number/README.md

@@ -1,7 +1,7 @@
 # [17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)
 
 
-## 题目:
+## 题目
 
 Given a string containing digits from `2-9` inclusive, return all possible letter combinations that the number could represent.
 

leetcode/0029.Divide-Two-Integers/README.md

@@ -1,7 +1,7 @@
 # [29. Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)
 
 
-## 题目:
+## 题目
 
 Given two integers `dividend` and `divisor`, divide two integers without using multiplication, division and mod operator.
 

leetcode/0033.Search-in-Rotated-Sorted-Array/README.md

@@ -1,6 +1,6 @@
 # [33. Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)
 
-## 题目:
+## 题目
 
 Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
 

leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/README.md

@@ -1,7 +1,7 @@
 # [34. Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)
 
 
-## 题目:
+## 题目
 
 Given an array of integers `nums` sorted in ascending order, find the starting and ending position of a given `target` value.
 

leetcode/0035.Search-Insert-Position/README.md

@@ -1,7 +1,7 @@
 # [35. Search Insert Position](https://leetcode.com/problems/search-insert-position/)
 
 
-## 题目:
+## 题目
 
 Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
 

leetcode/0036.Valid-Sudoku/README.md

@@ -1,7 +1,7 @@
 # [36. Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)
 
 
-## 题目:
+## 题目
 
 Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated **according to the following rules**:
 

leetcode/0037.Sudoku-Solver/README.md

@@ -2,7 +2,7 @@
 
 
 
-## 题目:
+## 题目
 
 Write a program to solve a Sudoku puzzle by filling the empty cells.
 

leetcode/0055.Jump-Game/README.md

@@ -1,4 +1,4 @@
-# 55. Jump Game
+# [55. Jump Game](https://leetcode.com/problems/jump-game/)
 
 
 ## 题目

leetcode/0066.Plus-One/README.md

@@ -1,7 +1,7 @@
 # [66. Plus One](https://leetcode.com/problems/plus-one/)
 
 
-## 题目:
+## 题目
 
 Given a **non-empty** array of digits representing a non-negative integer, plus one to the integer.
 

leetcode/0074.Search-a-2D-Matrix/README.md

@@ -1,7 +1,7 @@
 # [74. Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)
 
 
-## 题目:
+## 题目
 
 Write an efficient algorithm that searches for a value in an *m* x *n* matrix. This matrix has the following properties:
 

leetcode/0081.Search-in-Rotated-Sorted-Array-II/README.md

@@ -1,7 +1,7 @@
 # [81. Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)
 
 
-## 题目:
+## 题目
 
 Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
 

leetcode/0095.Unique-Binary-Search-Trees-II/README.md

@@ -1,7 +1,7 @@
 # [95. Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/)
 
 
-## 题目:
+## 题目
 
 Given an integer *n*, generate all structurally unique **BST's** (binary search trees) that store values 1 ... *n*.
 

leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/README.md

@@ -1,7 +1,7 @@
 # [105. Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)
 
 
-## 题目:
+## 题目
 
 Given preorder and inorder traversal of a tree, construct the binary tree.
 

leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/README.md

@@ -1,6 +1,6 @@
 # [106. Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)
 
-## 题目:
+## 题目
 
 Given inorder and postorder traversal of a tree, construct the binary tree.
 

leetcode/0128.Longest-Consecutive-Sequence/README.md

@@ -1,7 +1,7 @@
 # [128. Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)
 
 
-## 题目:
+## 题目
 
 Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
 

leetcode/0130.Surrounded-Regions/README.md

@@ -2,7 +2,7 @@
 
 
 
-## 题目:
+## 题目
 
 Given a 2D board containing `'X'` and `'O'` (**the letter O**), capture all regions surrounded by `'X'`.
 

leetcode/0136.Single-Number/README.md

@@ -1,6 +1,6 @@
 # [136. Single Number](https://leetcode.com/problems/single-number/)
 
-## 题目:
+## 题目
 
 Given a **non-empty** array of integers, every element appears *twice* except for one. Find that single one.
 

leetcode/0137.Single-Number-II/README.md

@@ -1,7 +1,7 @@
 # [137. Single Number II](https://leetcode.com/problems/single-number-ii/)
 
 
-## 题目:
+## 题目
 
 Given a **non-empty** array of integers, every element appears *three* times except for one, which appears exactly once. Find that single one.
 

leetcode/0151.Reverse-Words-in-a-String/README.md

@@ -2,7 +2,7 @@
 
 
 
-## 题目:
+## 题目
 
 Given an input string, reverse the string word by word.
 

leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/README.md

@@ -1,7 +1,7 @@
 # [153. Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)
 
 
-## 题目:
+## 题目
 
 Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
 

leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II/README.md

@@ -1,7 +1,7 @@
 # [154. Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/)
 
 
-## 题目:
+## 题目
 
 Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
 

leetcode/0162.Find-Peak-Element/README.md

@@ -1,7 +1,7 @@
 # [162. Find Peak Element](https://leetcode.com/problems/find-peak-element/)
 
 
-## 题目:
+## 题目
 
 A peak element is an element that is greater than its neighbors.
 

leetcode/0169.Majority-Element/README.md

@@ -1,7 +1,7 @@
 # [169. Majority Element](https://leetcode.com/problems/majority-element/)
 
 
-## 题目:
+## 题目
 
 Given an array of size n, find the majority element. The majority element is the element that appears **more than** `⌊ n/2 ⌋` times.
 

leetcode/0172.Factorial-Trailing-Zeroes/README.md

@@ -1,7 +1,7 @@
 # [172. Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/)
 
 
-## 题目:
+## 题目
 
 Given an integer n, return the number of trailing zeroes in n!.
 

leetcode/0174.Dungeon-Game/README.md

@@ -1,6 +1,6 @@
 # [174. Dungeon Game](https://leetcode.com/problems/dungeon-game/)
 
-## 题目:
+## 题目
 
 The demons had captured the princess (**P**) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (**K**) was initially positioned in the top-left room and must fight his way through the dungeon to rescue the princess.
 

leetcode/0187.Repeated-DNA-Sequences/README.md

@@ -1,7 +1,7 @@
 # [187. Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/)
 
 
-## 题目:
+## 题目
 
 All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes useful to identify repeated sequences within the DNA.
 

leetcode/0190.Reverse-Bits/README.md

@@ -1,7 +1,7 @@
 # [190. Reverse Bits](https://leetcode.com/problems/reverse-bits/)
 
 
-## 题目:
+## 题目
 
 Reverse bits of a given 32 bits unsigned integer.
 

leetcode/0201.Bitwise-AND-of-Numbers-Range/README.md

@@ -1,7 +1,7 @@
 # [201. Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/)
 
 
-## 题目:
+## 题目
 
 Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.
 

leetcode/0204.Count-Primes/README.md

@@ -1,7 +1,7 @@
 # [204. Count Primes](https://leetcode.com/problems/count-primes/)
 
 
-## 题目:
+## 题目
 
 Count the number of prime numbers less than a non-negative number, **n**.
 

leetcode/0218.The-Skyline-Problem/README.md

@@ -1,6 +1,6 @@
 # [218. The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/)
 
-## 题目:
+## 题目
 
 A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are **given the locations and height of all the buildings** as shown on a cityscape photo (Figure A), write a program to **output the skyline** formed by these buildings collectively (Figure B).
 

leetcode/0223.Rectangle-Area/README.md

@@ -1,7 +1,7 @@
 # [223. Rectangle Area](https://leetcode.com/problems/rectangle-area/)
 
 
-## 题目:
+## 题目
 
 Find the total area covered by two **rectilinear** rectangles in a **2D** plane.
 

leetcode/0229.Majority-Element-II/README.md

@@ -1,7 +1,7 @@
 # [229. Majority Element II](https://leetcode.com/problems/majority-element-ii/)
 
 
-## 题目:
+## 题目
 
 Given an integer array of size n, find all elements that appear more than `⌊ n/3 ⌋` times.
 

leetcode/0240.Search-a-2D-Matrix-II/README.md

@@ -1,7 +1,7 @@
 # [240. Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/)
 
 
-## 题目:
+## 题目
 
 Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
 

leetcode/0260.Single-Number-III/README.md

@@ -1,7 +1,7 @@
 # [260. Single Number III](https://leetcode.com/problems/single-number-iii/)
 
 
-## 题目:
+## 题目
 
 Given an array of numbers `nums`, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.
 

leetcode/0268.Missing-Number/README.md

@@ -1,7 +1,7 @@
 # [268. Missing Number](https://leetcode.com/problems/missing-number/)
 
 
-## 题目:
+## 题目
 
 Given an array containing n distinct numbers taken from `0, 1, 2, ..., n`, find the one that is missing from the array.
 

leetcode/0275.H-Index-II/README.md

@@ -1,6 +1,6 @@
 # [275. H-Index II](https://leetcode.com/problems/h-index-ii/)
 
-## 题目:
+## 题目
 
 Given an array of citations **sorted in ascending order** (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.
 

leetcode/0303.Range-Sum-Query---Immutable/README.md

@@ -1,7 +1,7 @@
 # [303. Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/)
 
 
-## 题目:
+## 题目
 
 Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
 

leetcode/0307.Range-Sum-Query---Mutable/README.md

@@ -1,7 +1,7 @@
 # [307. Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/)
 
 
-## 题目:
+## 题目
 
 Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
 

leetcode/0315.Count-of-Smaller-Numbers-After-Self/README.md

@@ -1,7 +1,7 @@
 # [315. Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/)
 
 
-## 题目:
+## 题目
 
 You are given an integer array nums and you have to return a new counts array. The counts array has the property where `counts[i]` is the number of smaller elements to the right of `nums[i]`.
 

leetcode/0318.Maximum-Product-of-Word-Lengths/README.md

@@ -1,7 +1,7 @@
 # [318. Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/)
 
 
-## 题目:
+## 题目
 
 Given a string array `words`, find the maximum value of `length(word[i]) * length(word[j])` where the two words do not share common letters. You may assume that each word will contain only lower case letters. If no such two words exist, return 0.
 

leetcode/0327.Count-of-Range-Sum/README.md

@@ -1,7 +1,7 @@
 # [327. Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/)
 
 
-## 题目:
+## 题目
 
 Given an integer array `nums`, return the number of range sums that lie in `[lower, upper]` inclusive.Range sum `S(i, j)` is defined as the sum of the elements in `nums` between indices `i` and `j` (`i` ≤ `j`), inclusive.
 

leetcode/0329.Longest-Increasing-Path-in-a-Matrix/README.md

@@ -1,7 +1,7 @@
 # [329. Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/)
 
 
-## 题目:
+## 题目
 
 Given an integer matrix, find the length of the longest increasing path.
 

leetcode/0337.House-Robber-III/README.md

@@ -1,4 +1,5 @@
-# 337. House Robber III
+# [337. House Robber III](https://leetcode.com/problems/house-robber-iii/)
+
 
 
 ## 题目