mirror of
https://github.com/CyC2018/Interview-Notebook.git
synced 2026-10-27 05:23:46 +00:00
Update 53. 数字在排序数组中出现的次数.md
代码块标注语言。
This commit is contained in:
@@ -66,7 +66,7 @@ public int GetNumberOfK(int[] nums, int K) {
|
||||
|
||||
需要注意以上实现的查找第一个位置的 binarySearch 方法,h 的初始值为 nums.length,而不是 nums.length - 1。先看以下示例:
|
||||
|
||||
```
|
||||
```text
|
||||
nums = [2,2], k = 2
|
||||
```
|
||||
|
||||
|
||||
Reference in New Issue
Block a user