Commit fa2a8a7

authored

Merge pull request youngyangyang04#1673 from askaldk/master

update 455.分發餅乾 C語言

2 parents d3d3b3d + 2772fd4 commit fa2a8a7Copy full SHA for fa2a8a7

File tree

+28

-0

lines changed

+28

-0

lines changed

Lines changed: 28 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -274,6 +274,7 @@ function findContentChildren(g: number[], s: number[]): number {`
`274`	`274`	`### C`
`275`	`275`
`276`	`276`	```c
	`277`	`+///小餅乾先餵飽小胃口的`
`277`	`278`	`int cmp(int* a, int* b) {`
`278`	`279`	`return a - b;`
`279`	`280`	`}`
`@@ -296,6 +297,33 @@ int findContentChildren(int* g, int gSize, int* s, int sSize){`
`296`	`297`	`}`
`297`	`298`	```
`298`	`299`
	`300`	+```c
	`301`	`+///大餅乾先餵飽大胃口的`
	`302`	`+int cmp(int* a, int* b) {`
	`303`	`+ return a - b;`
	`304`	`+}`
	`305`	`+`
	`306`	`+int findContentChildren(int* g, int gSize, int* s, int sSize){`
	`307`	`+ if(sSize == 0)`
	`308`	`+ return 0;`
	`309`	`+`
	`310`	`+ //将两个数组排序为升序`
	`311`	`+ qsort(g, gSize, sizeof(int), cmp);`
	`312`	`+ qsort(s, sSize, sizeof(int), cmp);`
	`313`	`+`
	`314`	`+ int count = 0;`
	`315`	`+ int start = sSize - 1;`
	`316`	`+`
	`317`	`+ for(int i = gSize - 1; i >= 0; i--) {`
	`318`	`+ if(start >= 0 && s[start] >= g[i] ) {`
	`319`	`+ start--;`
	`320`	`+ count++;`
	`321`	`+ }`
	`322`	`+ }`
	`323`	`+ return count;`
	`324`	`+}`
	`325`	+```
	`326`	`+`
`299`	`327`	`### Scala`
`300`	`328`
`301`	`329`	```scala

Comments

(0)