Commit bb0dfe8

committed

Add js solution to leetcode problem: no.0455

1 parent 8da5ac6 commit bb0dfe8Copy full SHA for bb0dfe8

File tree

+70

-0

lines changed

+70

-0

lines changed

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -66,6 +66,31 @@`
`66`	`66`
`67`	`67`	```
`68`	`68`
	`69`	`+### JavaScript`
	`70`	`+`
	`71`	+```js
	`72`	`+/**`
	`73`	`+ * @param {number[]} g`
	`74`	`+ * @param {number[]} s`
	`75`	`+ * @return {number}`
	`76`	`+ */`
	`77`	`+var findContentChildren = function (g, s) {`
	`78`	`+ let len1 = g.length, len2 = s.length;`
	`79`	`+ if (len2 === 0) return 0;`
	`80`	`+ g.sort((a, b) => a - b);`
	`81`	`+ s.sort((a, b) => a - b);`
	`82`	`+ let i = 0, j = 0;`
	`83`	`+ while (i < len1 && j < len2) {`
	`84`	`+ while (s[j] < g[i]) j++;`
	`85`	`+ if (s[j] >= g[i]) {`
	`86`	`+ i++;`
	`87`	`+ j++;`
	`88`	`+ } else break;`
	`89`	`+ }`
	`90`	`+ return i;`
	`91`	`+};`
	`92`	+```
	`93`	`+`
`69`	`94`	`### ...`
`70`	`95`
`71`	`96`	```

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -55,6 +55,31 @@ You need to output 2.`
`55`	`55`
`56`	`56`	```
`57`	`57`
	`58`	`+### JavaScript`
	`59`	`+`
	`60`	+```js
	`61`	`+/**`
	`62`	`+ * @param {number[]} g`
	`63`	`+ * @param {number[]} s`
	`64`	`+ * @return {number}`
	`65`	`+ */`
	`66`	`+var findContentChildren = function (g, s) {`
	`67`	`+ let len1 = g.length, len2 = s.length;`
	`68`	`+ if (len2 === 0) return 0;`
	`69`	`+ g.sort((a, b) => a - b);`
	`70`	`+ s.sort((a, b) => a - b);`
	`71`	`+ let i = 0, j = 0;`
	`72`	`+ while (i < len1 && j < len2) {`
	`73`	`+ while (s[j] < g[i]) j++;`
	`74`	`+ if (s[j] >= g[i]) {`
	`75`	`+ i++;`
	`76`	`+ j++;`
	`77`	`+ } else break;`
	`78`	`+ }`
	`79`	`+ return i;`
	`80`	`+};`
	`81`	+```
	`82`	`+`
`58`	`83`	`### ...`
`59`	`84`
`60`	`85`	```

Lines changed: 20 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,20 @@`
	`1`	`+/**`
	`2`	`+ * @param {number[]} g`
	`3`	`+ * @param {number[]} s`
	`4`	`+ * @return {number}`
	`5`	`+ */`
	`6`	`+var findContentChildren = function (g, s) {`
	`7`	`+ let len1 = g.length, len2 = s.length;`
	`8`	`+ if (len2 === 0) return 0;`
	`9`	`+ g.sort((a, b) => a - b);`
	`10`	`+ s.sort((a, b) => a - b);`
	`11`	`+ let i = 0, j = 0;`
	`12`	`+ while (i < len1 && j < len2) {`
	`13`	`+ while (s[j] < g[i]) j++;`
	`14`	`+ if (s[j] >= g[i]) {`
	`15`	`+ i++;`
	`16`	`+ j++;`
	`17`	`+ } else break;`
	`18`	`+ }`
	`19`	`+ return i;`
	`20`	`+};`

Comments

(0)