360笔试编程题

360笔试题目：

C++简单实现：

#include <stdio.h>
#include <iostream>
#include <math.h>
#include <sstream>
#include <cstring>
#include <vector>
#include <algorithm>

using namespace std;


const int MAXWATCHTIMES = 2001;
const int MAXKINDS = 101;
int watchFlowers[MAXWATCHTIMES] = {0};
int flowerKinds[MAXKINDS] = {0};

void getCount(int start, int anEnd, int & resultSingle);

int main() {
    int n;
    int m;
    vector<int> result;
    cin >> n >> m;
    result.clear();
    for (int j = 0; j < n; ++j) {
        cin >> watchFlowers[j];
    }

    int Q;
    int start;
    int end;
    int resultSingle = 0;
    cin >> Q;
    for (int i = 0; i <  Q; ++i) {
        cin >> start >> end;
        getCount(start,end,resultSingle);
        result.push_back(resultSingle);
    }

    vector<int>::iterator it = result.begin();
    for (;it != result.end(); ++it) {
        cout << *it << endl;
    }
}

void getCount(int start, int anEnd, int & resultSingle) {
    start--;
    anEnd--;
    for (int k = 0; k < 101; ++k) {
        flowerKinds[k] = 0;
    }
    for (int i = start; i <= anEnd; ++i) {
        flowerKinds[watchFlowers[i]] = 1;
    }

    resultSingle = 0;
    for (int j = 0; j < 101; ++j) {
        resultSingle += flowerKinds[j];
    }
}

------------------------------------------------通过60%

-------------------------------------------------------------------------------------------------------------------------------------------------------------

另附加第三道编程题，未做，留作参考！