示例 1:
输入: nums = [5,7,7,8,8,10], target = 8输出: 2示例 2:
输入: nums = [5,7,7,8,8,10], target = 6输出: 0 
限制：
0 <= 数组长度 <= 50000


来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

    public int search(int[] nums, int target) {        int ans = 0;        for (int num : nums) {            if (num == target) {                ans++;            }        }
        return ans;    }

public int search(int[] nums, int target) {            int ans = 0;            int left = 0;            int n = nums.length;            int right = n - 1;            int idx = -1;
            while (left < right) {                int mid = left + (right - left) / 2;                if (nums[mid] == target) {                    idx = mid;                    break;                } else if (nums[mid] < target) {                    left = mid + 1;                } else {                    right = mid - 1;                }            }            if (idx > -1) {                for (int i = idx - 1; i >= 0; i--) {                    if (nums[idx] != target) {                        break;                    } else {                        ans++;                    }                }
                for (int i = idx ; i < n; i++) {                    if (nums[idx] != target) {                        break;                    } else {                        ans++;                    }                }            }
            return ans;        }

    public int search(int[] nums, int target) {        return (int) Arrays.stream(nums).filter(num -> (num == target)).count();    }