public class Solution {
public int GetNumberOfK(int[] array, int k) {
int temp = 0;
for (int i = 0; i < array.length; i++) {
if (k == array[i]) {
temp++;
}
}
return temp;
}
}
18.数字在数组中出现的次数题目描述统计一个数字在数组中出现的次数输入[1,2,3,3,3,3,4,5],3返回值4分析1.在数组中对指定k值做判断,如果相等于数组里面的值,就让累加器加1代码实现public class Solution { public int GetNumberOfK(int[] array, int k) { int temp = 0; for (int i = 0; i < array.length; i++) { if (k ==