Commit 7cb435d

committed

Update.

1 parent 6e0e201 commit 7cb435dCopy full SHA for 7cb435d

File tree

-6

lines changed

-6

lines changed

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -46,9 +46,9 @@ tags:`
`46`	`46`
`47`	`47`	`提示:`
`48`	`48`
`49`		-- `2 <= nums.length <= 104`
`50`		-- `-109 <= nums[i] <= 109`
`51`		-- `-109 <= target <= 109`
	`49`	+- `2 <= nums.length <= 10^4`
	`50`	+- `-10^9 <= nums[i] <= 10^9`
	`51`	+- `-10^9 <= target <= 10^9`
`52`	`52`	`- 只会存在一个有效答案`
`53`	`53`
`54`	`54`	`进阶: 你可以想出一个时间复杂度小于 O(n<sup>2</sup>) 的算法吗?`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -62,10 +62,10 @@ tags:`
`62`	`62`	- `0 <= m <= 1000`
`63`	`63`	- `0 <= n <= 1000`
`64`	`64`	- `1 <= m + n <= 2000`
`65`		-- `-106 <= nums1[i], nums2[i] <= 106`
	`65`	+- `-106 <= nums1[i], nums2[i] <= 10^6`
`66`	`66`
`67`	`67`
`68`		-进阶:你能设计一个时间复杂度为 `O(log (m+n))` 的算法解决此问题吗?
	`68`	+进阶:你能设计一个时间复杂度为 `O(log (m+n))` 的算法解决此问题吗?
`69`	`69`
`70`	`70`	`<br/>`
`71`	`71`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -78,7 +78,7 @@ nav:`
`78`	`78`	`- leetcode题解: solutions/intro.md`
`79`	`79`	`- 玩转力扣Tips: solutions/tips.md`
`80`	`80`	`- leetcode1 两数之和[简单]: solutions/leetcode1 两数之和[简单].md`
`81`		`- - 寻找两个正序数组的中位数[困难]: solutions/leetcode4 寻找两个正序数组的中位数[困难].md`
	`81`	`+ - leetcode4 寻找两个正序数组的中位数[困难]: solutions/leetcode4 寻找两个正序数组的中位数[困难].md`
`82`	`82`	`- leetcode36 有效的数独[中等]: solutions/leetcode36 有效的数独[中等].md`
`83`	`83`	`- leetcode38 外观数列(报数)[中等]: solutions/leetcode38 外观数列(报数)[中等].md`
`84`	`84`

Comments

(0)