统计一个数字在排序数组（从小到大排序）中出现的次数。

// test20.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cstring>
#include<string.h>
#include<deque>

using namespace std;

class Solution {
public:
    int GetNumberOfK(vector<int> data, int k) {
        int count = 0;
        for (int i = 0;i < data.size();i++)
        {
            if(k==data[i])
              count++;
        }
        return count;
    }
};
int main()
{
    
    Solution so;
    //int count = so.FirstNotRepeatingChar("wangdanwang");
    vector<int> data = { 1,2,3,4,5,5,5,6,7,8};
    int count = so.GetNumberOfK(data,5);
    cout << count << endl;
    
    
    
    cout << endl;
    return 0;
}

转载于:https://www.cnblogs.com/wdan2016/p/6021215.html