https://blog.youkuaiyun.com/weixin_55902321zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/weixin_55902321/article/details/158808604https://blog.youkuaiyun.com/weixin_55902321/article/details/158808604weixin_55902321Mon, 09 Mar 2026 09:26:03 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/158807782https://blog.youkuaiyun.com/weixin_55902321/article/details/158807782weixin_55902321Sun, 08 Mar 2026 16:28:43 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/158807564https://blog.youkuaiyun.com/weixin_55902321/article/details/158807564weixin_55902321Sun, 08 Mar 2026 15:29:09 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/158807332https://blog.youkuaiyun.com/weixin_55902321/article/details/158807332weixin_55902321Sun, 08 Mar 2026 15:05:24 +0800= g[i]，我们可以将这个饼干 j 分配给孩子 i ，这个孩子会得到满足。你的目标是尽可能满足越多数量的孩子，并输出这个最大数值。示例 1: 输入: g = [1,2,3], s = [1,1] 输出: 1 解释:你有三个孩子和两块小饼干，3 个孩子的胃口值分别是：1,2,3]]>https://blog.youkuaiyun.com/weixin_55902321/article/details/158803750https://blog.youkuaiyun.com/weixin_55902321/article/details/158803750weixin_55902321Sun, 08 Mar 2026 14:20:38 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/158803407https://blog.youkuaiyun.com/weixin_55902321/article/details/158803407weixin_55902321Sun, 08 Mar 2026 10:20:50 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/158779087https://blog.youkuaiyun.com/weixin_55902321/article/details/158779087weixin_55902321Sat, 07 Mar 2026 22:22:10 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/158778399https://blog.youkuaiyun.com/weixin_55902321/article/details/158778399weixin_55902321Sat, 07 Mar 2026 21:43:45 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/158777748https://blog.youkuaiyun.com/weixin_55902321/article/details/158777748weixin_55902321Sat, 07 Mar 2026 21:03:15 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/155444507https://blog.youkuaiyun.com/weixin_55902321/article/details/155444507weixin_55902321Fri, 05 Dec 2025 11:03:36 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/155442107https://blog.youkuaiyun.com/weixin_55902321/article/details/155442107weixin_55902321Mon, 01 Dec 2025 10:23:23 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/154990374https://blog.youkuaiyun.com/weixin_55902321/article/details/154990374weixin_55902321Wed, 19 Nov 2025 13:51:07 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/154476200https://blog.youkuaiyun.com/weixin_55902321/article/details/154476200weixin_55902321Thu, 06 Nov 2025 10:50:08 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/154340361https://blog.youkuaiyun.com/weixin_55902321/article/details/154340361weixin_55902321Tue, 04 Nov 2025 13:34:16 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/154172673https://blog.youkuaiyun.com/weixin_55902321/article/details/154172673weixin_55902321Fri, 31 Oct 2025 14:03:42 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/154117597https://blog.youkuaiyun.com/weixin_55902321/article/details/154117597weixin_55902321Thu, 30 Oct 2025 13:34:42 +0800= g[i]，我们可以将这个饼干 j 分配给孩子 i ，这个孩子会得到满足。你的目标是尽可能满足越多数量的孩子，并输出这个最大数值。示例 1:输入: g = [1,2,3], s = [1,1]]]>https://blog.youkuaiyun.com/weixin_55902321/article/details/153879013https://blog.youkuaiyun.com/weixin_55902321/article/details/153879013weixin_55902321Sun, 26 Oct 2025 16:19:59 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/153875209https://blog.youkuaiyun.com/weixin_55902321/article/details/153875209weixin_55902321Sat, 25 Oct 2025 17:00:25 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/153727041https://blog.youkuaiyun.com/weixin_55902321/article/details/153727041weixin_55902321Wed, 22 Oct 2025 16:53:33 +0800https://blog.youkuaiyun.com/weixin_55902321/article/details/152080640https://blog.youkuaiyun.com/weixin_55902321/article/details/152080640weixin_55902321Thu, 25 Sep 2025 13:58:57 +0800