提交时间:2024-03-02 10:55:10
运行 ID: 133943
#include <iostream> #include <vector> #include <algorithm> using namespace std; int findContentChildren(vector<int>& g, vector<int>& s) { int count = 0, j = 0, i = 0; for (; i < s.size() && j < g.size();) { if (s[i] >= g[j]) { count++; j++; i++; } else { ++i; } } return count; } int main() { vector<int> vec1{ 1,2 }, vec2{ 1,2, 3 }; cout << findContentChildren(vec1, vec2); system("PAUSE"); return 0; }