题解 | #数字在升序数组中出现的次数#
数字在升序数组中出现的次数
https://www.nowcoder.com/practice/70610bf967994b22bb1c26f9ae901fa2
public class Solution { public int GetNumberOfK(int [] array , int k) { int sum = 0; for(int i=0;i<array.length;i++){ if(array[i] == k ){ sum ++ ; } } return sum ; } }