auto commit
This commit is contained in:
@ -138,9 +138,7 @@ k = 8,
|
||||
return 13.
|
||||
```
|
||||
|
||||
<EFBFBD><EFBFBD>题参考:[Share my thoughts and Clean Java Code
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/discuss/85173) / [力扣](https://leetcode-cn.com/problems/kth-smallest-element-in-a-sorted-matrix/discuss/85173)
|
||||
解题参考:[Share my thoughts and Clean Java Code](https://leetcode-cn.com/problems/kth-smallest-element-in-a-sorted-matrix/discuss/85173)
|
||||
|
||||
二分查找解法:
|
||||
|
||||
@ -233,15 +231,6 @@ private void swap(int[] nums, int i, int j) {
|
||||
}
|
||||
```
|
||||
|
||||
类似题目:
|
||||
|
||||
[448\. Find All Numbers Disappeared in an Array (Easy)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/description/),寻找所有丢失的元<E79A84>) / [力扣](https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array/description/),寻找所有丢失的元<E79A84>)
|
||||
[442\. Find All Duplicates in an Array (Medium)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/find-all-duplicates-in-an-array/description/),寻找所有重复的元素<E58583>) / [力扣](https://leetcode-cn.com/problems/find-all-duplicates-in-an-array/description/),寻找所有重复的元素<E58583>)
|
||||
|
||||
# 7. 找出数组中重复的数,数组值在 [1, n] 之间
|
||||
|
||||
287\. Find the Duplicate Number (Medium)
|
||||
|
Reference in New Issue
Block a user