Commit fcdfa34

committed

feat: add solutions to lc problem: No.2206

No.2206.Divide Array Into Equal Pairs

1 parent 12bdfeb commit fcdfa34Copy full SHA for fcdfa34

File tree

+129

-0

lines changed

+129

-0

lines changed

Lines changed: 46 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -72,7 +72,53 @@ class Solution:`
`72`	`72`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`73`	`73`
`74`	`74`	```java
	`75`	`+class Solution {`
	`76`	`+ public boolean divideArray(int[] nums) {`
	`77`	`+ int[] cnt = new int[510];`
	`78`	`+ for (int v : nums) {`
	`79`	`+ ++cnt[v];`
	`80`	`+ }`
	`81`	`+ for (int v : cnt) {`
	`82`	`+ if (v % 2 != 0) {`
	`83`	`+ return false;`
	`84`	`+ }`
	`85`	`+ }`
	`86`	`+ return true;`
	`87`	`+ }`
	`88`	`+}`
	`89`	+```
	`90`	`+`
	`91`	`+### C++`
	`92`	`+`
	`93`	+```cpp
	`94`	`+class Solution {`
	`95`	`+public:`
	`96`	`+ bool divideArray(vector<int>& nums) {`
	`97`	`+ vector<int> cnt(510);`
	`98`	`+ for (int& v : nums) ++cnt[v];`
	`99`	`+ for (int& v : cnt)`
	`100`	`+ if (v % 2)`
	`101`	`+ return false;`
	`102`	`+ return true;`
	`103`	`+ }`
	`104`	`+};`
	`105`	+```
`75`	`106`
	`107`	`+### Go`
	`108`	`+`
	`109`	+```go
	`110`	`+func divideArray(nums []int) bool {`
	`111`	`+ cnt := make([]int, 510)`
	`112`	`+ for _, v := range nums {`
	`113`	`+ cnt[v]++`
	`114`	`+ }`
	`115`	`+ for _, v := range cnt {`
	`116`	`+ if v%2 == 1 {`
	`117`	`+ return false`
	`118`	`+ }`
	`119`	`+ }`
	`120`	`+ return true`
	`121`	`+}`
`76`	`122`	```
`77`	`123`
`78`	`124`	`### TypeScript`

Lines changed: 46 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -62,7 +62,53 @@ class Solution:`
`62`	`62`	`### Java`
`63`	`63`
`64`	`64`	```java
	`65`	`+class Solution {`
	`66`	`+ public boolean divideArray(int[] nums) {`
	`67`	`+ int[] cnt = new int[510];`
	`68`	`+ for (int v : nums) {`
	`69`	`+ ++cnt[v];`
	`70`	`+ }`
	`71`	`+ for (int v : cnt) {`
	`72`	`+ if (v % 2 != 0) {`
	`73`	`+ return false;`
	`74`	`+ }`
	`75`	`+ }`
	`76`	`+ return true;`
	`77`	`+ }`
	`78`	`+}`
	`79`	+```
	`80`	`+`
	`81`	`+### C++`
	`82`	`+`
	`83`	+```cpp
	`84`	`+class Solution {`
	`85`	`+public:`
	`86`	`+ bool divideArray(vector<int>& nums) {`
	`87`	`+ vector<int> cnt(510);`
	`88`	`+ for (int& v : nums) ++cnt[v];`
	`89`	`+ for (int& v : cnt)`
	`90`	`+ if (v % 2)`
	`91`	`+ return false;`
	`92`	`+ return true;`
	`93`	`+ }`
	`94`	`+};`
	`95`	+```
`65`	`96`
	`97`	`+### Go`
	`98`	`+`
	`99`	+```go
	`100`	`+func divideArray(nums []int) bool {`
	`101`	`+ cnt := make([]int, 510)`
	`102`	`+ for _, v := range nums {`
	`103`	`+ cnt[v]++`
	`104`	`+ }`
	`105`	`+ for _, v := range cnt {`
	`106`	`+ if v%2 == 1 {`
	`107`	`+ return false`
	`108`	`+ }`
	`109`	`+ }`
	`110`	`+ return true`
	`111`	`+}`
`66`	`112`	```
`67`	`113`
`68`	`114`	`### TypeScript`

Lines changed: 11 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,11 @@`
	`1`	`+class Solution {`
	`2`	`+public:`
	`3`	`+ bool divideArray(vector<int>& nums) {`
	`4`	`+ vector<int> cnt(510);`
	`5`	`+ for (int& v : nums) ++cnt[v];`
	`6`	`+ for (int& v : cnt)`
	`7`	`+ if (v % 2)`
	`8`	`+ return false;`
	`9`	`+ return true;`
	`10`	`+ }`
	`11`	`+};`

Lines changed: 12 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,12 @@`
	`1`	`+func divideArray(nums []int) bool {`
	`2`	`+ cnt := make([]int, 510)`
	`3`	`+ for _, v := range nums {`
	`4`	`+ cnt[v]++`
	`5`	`+ }`
	`6`	`+ for _, v := range cnt {`
	`7`	`+ if v%2 == 1 {`
	`8`	`+ return false`
	`9`	`+ }`
	`10`	`+ }`
	`11`	`+ return true`
	`12`	`+}`

Lines changed: 14 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,14 @@`
	`1`	`+class Solution {`
	`2`	`+ public boolean divideArray(int[] nums) {`
	`3`	`+ int[] cnt = new int[510];`
	`4`	`+ for (int v : nums) {`
	`5`	`+ ++cnt[v];`
	`6`	`+ }`
	`7`	`+ for (int v : cnt) {`
	`8`	`+ if (v % 2 != 0) {`
	`9`	`+ return false;`
	`10`	`+ }`
	`11`	`+ }`
	`12`	`+ return true;`
	`13`	`+ }`
	`14`	`+}`

Comments

(0)