> For the complete documentation index, see [llms.txt](https://ryukiedev.gitbook.io/wiki/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://ryukiedev.gitbook.io/wiki/shu-ju-jie-gou-yu-suan-fa/jian-zhi-offerswift/53i.-zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi.md).

# 53-I.在排序数组中查找数字

### 一、 题目

统计一个数字在排序数组中出现的次数。

示例 1:

输入: nums = \[5,7,7,8,8,10], target = 8

输出: 2

示例 2:

输入: nums = \[5,7,7,8,8,10], target = 6

输出: 0   提示：

0 <= nums.length <= 105

-109 <= nums\[i] <= 109

nums 是一个非递减数组

-109 <= target <= 109

来源：力扣（LeetCode）

链接：<https://leetcode-cn.com/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof>

著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

### 二、 解法

```
func search(_ nums: [Int], _ target: Int) -> Int {
    guard
        let first = nums.firstIndex(of: target),
        let last = nums.lastIndex(of: target)
    else {
        return 0
    }
    return last - first + 1
}
```