数组越界限制——短路的顺序 📅 2026/7/6 4:27:14 455. 分发饼干 - 力扣LeetCodeclass Solution {public:int findContentChildren(vectorint g, vectorint s) {sort(g.begin(),g.end());sort(s.begin(),s.end());if(s.empty()) return 0;int js.size()-1;int res0;for(int ig.size()-1;i0;i--){if(j0 s[j]g[i] ){//注意短路顺序j--;res;}}return res;}};