Commit 9bdfdc7

authored

feat: add solutions to lc problem: No.0575 (doocs#2996)

No.0575.Distribute Candies

1 parent 597a926 commit 9bdfdc7Copy full SHA for 9bdfdc7

File tree

+35

-8

lines changed

+35

-8

lines changed

Lines changed: 15 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -66,7 +66,11 @@ tags:`
`66`	`66`
`67`	`67`	`<!-- solution:start -->`
`68`	`68`
`69`		`-### 方法一`
	`69`	`+### 方法一:哈希表`
	`70`	`+`
	`71`	`+我们用一个哈希表来存储糖果的种类,如果糖果的种类数小于 $n / 2,ドル那么 Alice 最多可以吃到的糖果种类数就是糖果的种类数;否则,Alice 最多可以吃到的糖果种类数就是 $n / 2$。`
	`72`	`+`
	`73`	`+时间复杂度 $O(n),ドル空间复杂度 $O(n)$。其中 $n$ 为糖果的数量。`
`70`	`74`
`71`	`75`	`<!-- tabs:start -->`
`72`	`76`
`@@ -98,8 +102,7 @@ class Solution {`
`98`	`102`	`class Solution {`
`99`	`103`	`public:`
`100`	`104`	`int distributeCandies(vector<int>& candyType) {`
`101`		`- unordered_set<int> s;`
`102`		`- for (int c : candyType) s.insert(c);`
	`105`	`+ unordered_set<int> s(candyType.begin(), candyType.end());`
`103`	`106`	`return min(candyType.size() >> 1, s.size());`
`104`	`107`	`}`
`105`	`108`	`};`
`@@ -117,6 +120,15 @@ func distributeCandies(candyType []int) int {`
`117`	`120`	`}`
`118`	`121`	```
`119`	`122`
	`123`	`+#### TypeScript`
	`124`	`+`
	`125`	+```ts
	`126`	`+function distributeCandies(candyType: number[]): number {`
	`127`	`+ const s = new Set(candyType);`
	`128`	`+ return Math.min(s.size, candyType.length >> 1);`
	`129`	`+}`
	`130`	+```
	`131`	`+`
`120`	`132`	`<!-- tabs:end -->`
`121`	`133`
`122`	`134`	`<!-- solution:end -->`

Lines changed: 15 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -64,7 +64,11 @@ tags:`
`64`	`64`
`65`	`65`	`<!-- solution:start -->`
`66`	`66`
`67`		`-### Solution 1`
	`67`	`+### Solution 1: Hash Table`
	`68`	`+`
	`69`	`+We use a hash table to store the types of candies. If the number of candy types is less than $n / 2,ドル then the maximum number of candy types that Alice can eat is the number of candy types. Otherwise, the maximum number of candy types that Alice can eat is $n / 2$.`
	`70`	`+`
	`71`	`+The time complexity is $O(n),ドル and the space complexity is $O(n)$. Where $n$ is the number of candies.`
`68`	`72`
`69`	`73`	`<!-- tabs:start -->`
`70`	`74`
`@@ -96,8 +100,7 @@ class Solution {`
`96`	`100`	`class Solution {`
`97`	`101`	`public:`
`98`	`102`	`int distributeCandies(vector<int>& candyType) {`
`99`		`- unordered_set<int> s;`
`100`		`- for (int c : candyType) s.insert(c);`
	`103`	`+ unordered_set<int> s(candyType.begin(), candyType.end());`
`101`	`104`	`return min(candyType.size() >> 1, s.size());`
`102`	`105`	`}`
`103`	`106`	`};`
`@@ -115,6 +118,15 @@ func distributeCandies(candyType []int) int {`
`115`	`118`	`}`
`116`	`119`	```
`117`	`120`
	`121`	`+#### TypeScript`
	`122`	`+`
	`123`	+```ts
	`124`	`+function distributeCandies(candyType: number[]): number {`
	`125`	`+ const s = new Set(candyType);`
	`126`	`+ return Math.min(s.size, candyType.length >> 1);`
	`127`	`+}`
	`128`	+```
	`129`	`+`
`118`	`130`	`<!-- tabs:end -->`
`119`	`131`
`120`	`132`	`<!-- solution:end -->`

Lines changed: 1 addition & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,8 +1,7 @@`
`1`	`1`	`class Solution {`
`2`	`2`	`public:`
`3`	`3`	`int distributeCandies(vector<int>& candyType) {`
`4`		`- unordered_set<int> s;`
`5`		`- for (int c : candyType) s.insert(c);`
	`4`	`+ unordered_set<int> s(candyType.begin(), candyType.end());`
`6`	`5`	`return min(candyType.size() >> 1, s.size());`
`7`	`6`	`}`
`8`	`7`	`};`

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,4 @@`
	`1`	`+function distributeCandies(candyType: number[]): number {`
	`2`	`+ const s = new Set(candyType);`
	`3`	`+ return Math.min(s.size, candyType.length >> 1);`
	`4`	`+}`

Comments

(0)