From 2772fd498da7160313210e1b58b2b86d907ac96a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E6=9D=8E=E6=98=82=E8=AC=99?= <aska0522@gmail.com>
Date: Fri, 30 Sep 2022 14:48:18 +0800
Subject: [PATCH] =?UTF-8?q?update=20455.=E5=88=86=E7=99=BC=E9=A4=85?=
 =?UTF-8?q?=E4=B9=BE=20C=E8=AA=9E=E8=A8=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0455.分发饼干.md | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)

diff --git a/problems/0455.分发饼干.md b/problems/0455.分发饼干.md
index f9e8e7f1..93a4c2d3 100644
--- a/problems/0455.分发饼干.md
+++ b/problems/0455.分发饼干.md
@@ -274,6 +274,7 @@ function findContentChildren(g: number[], s: number[]): number {
 ### C
 
 ```c
+///小餅乾先餵飽小胃口的
 int cmp(int* a, int* b) {
     return *a - *b;
 }
@@ -296,6 +297,33 @@ int findContentChildren(int* g, int gSize, int* s, int sSize){
 }
 ```
 
+```c
+///大餅乾先餵飽大胃口的
+int cmp(int* a, int* b) {
+    return *a - *b;
+}
+
+int findContentChildren(int* g, int gSize, int* s, int sSize){
+    if(sSize == 0)
+        return 0;
+
+    //将两个数组排序为升序
+    qsort(g, gSize, sizeof(int), cmp);
+    qsort(s, sSize, sizeof(int), cmp);
+
+    int count = 0;
+    int start = sSize - 1;
+
+    for(int i = gSize - 1; i >= 0; i--) {
+        if(start >= 0 && s[start] >= g[i] ) {
+            start--;
+            count++;
+        }
+    }
+    return count;
+}
+```
+
 ### Scala
 
 ```scala