数组越界限制——短路的顺序
455. 分发饼干 - 力扣(LeetCode)
class Solution {
public: int findContentChildren(vector<int>& g, vector<int>& s) { sort(g.begin(),g.end()); sort(s.begin(),s.end()); if(s.empty()) return 0; int js.size()-1; int res…
2026/7/6 4:27:14