Commit bd3ef8e

authored

feat: update solutions to lc problems: No.1929,1933 (doocs#3599)

* No.1929.Concatenation of Array * No.1933.Check if String Is Decomposable Into Value-Equal Substrings

1 parent 5ee2352 commit bd3ef8eCopy full SHA for bd3ef8e

File tree

+21

-90

lines changed

solution/1900-1999
- 1929.Concatenation of Array
- 1933.Check if String Is Decomposable Into Value-Equal Substrings

+21

-90

lines changed

Lines changed: 6 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -67,7 +67,11 @@ tags:`
`67`	`67`
`68`	`68`	`<!-- solution:start -->`
`69`	`69`
`70`		`-### 方法一`
	`70`	`+### 方法一:模拟`
	`71`	`+`
	`72`	`+我们直接根据题目描述模拟,将 $\textit{nums}$ 中的元素依次添加到答案数组中,然后再将 $\textit{nums}$ 中的元素再次添加到答案数组中。`
	`73`	`+`
	`74`	`+时间复杂度 $O(n),ドル空间复杂度 $O(n)$。其中 $n$ 为数组 $\textit{nums}$ 的长度。`
`71`	`75`
`72`	`76`	`<!-- tabs:start -->`
`73`	`77`
`@@ -142,9 +146,7 @@ impl Solution {`
`142`	`146`	`* @return {number[]}`
`143`	`147`	`*/`
`144`	`148`	`var getConcatenation = function (nums) {`
`145`		`- let ans = nums.slice();`
`146`		`- ans.splice(nums.length, 0, ...nums);`
`147`		`- return ans;`
	`149`	`+ return [...nums, ...nums];`
`148`	`150`	`};`
`149`	`151`	```
`150`	`152`

Lines changed: 6 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -60,7 +60,11 @@ tags:`
`60`	`60`
`61`	`61`	`<!-- solution:start -->`
`62`	`62`
`63`		`-### Solution 1`
	`63`	`+### Solution 1: Simulation`
	`64`	`+`
	`65`	`+We directly simulate according to the problem description by adding the elements of $\textit{nums}$ to the answer array one by one, and then adding the elements of $\textit{nums}$ to the answer array again.`
	`66`	`+`
	`67`	`+The time complexity is $O(n),ドル and the space complexity is $O(n)$. Here, $n$ is the length of the array $\textit{nums}$.`
`64`	`68`
`65`	`69`	`<!-- tabs:start -->`
`66`	`70`
`@@ -135,9 +139,7 @@ impl Solution {`
`135`	`139`	`* @return {number[]}`
`136`	`140`	`*/`
`137`	`141`	`var getConcatenation = function (nums) {`
`138`		`- let ans = nums.slice();`
`139`		`- ans.splice(nums.length, 0, ...nums);`
`140`		`- return ans;`
	`142`	`+ return [...nums, ...nums];`
`141`	`143`	`};`
`142`	`144`	```
`143`	`145`

Lines changed: 1 addition & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -3,7 +3,5 @@`
`3`	`3`	`* @return {number[]}`
`4`	`4`	`*/`
`5`	`5`	`var getConcatenation = function (nums) {`
`6`		`- let ans = nums.slice();`
`7`		`- ans.splice(nums.length, 0, ...nums);`
`8`		`- return ans;`
	`6`	`+ return [...nums, ...nums];`
`9`	`7`	`};`

Lines changed: 4 additions & 34 deletions

Original file line number	Diff line number	Diff line change
`@@ -82,18 +82,14 @@ tags:`
`82`	`82`	```python
`83`	`83`	`class Solution:`
`84`	`84`	`def isDecomposable(self, s: str) -> bool:`
`85`		`- i, n = 0, len(s)`
`86`	`85`	`cnt2 = 0`
`87`		`- while i < n:`
`88`		`- j = i`
`89`		`- while j < n and s[j] == s[i]:`
`90`		`- j += 1`
`91`		`- if (j - i) % 3 == 1:`
	`86`	`+ for _, g in groupby(s):`
	`87`	`+ m = len(list(g))`
	`88`	`+ if m % 3 == 1:`
`92`	`89`	`return False`
`93`		`- cnt2 += (j - i) % 3 == 2`
	`90`	`+ cnt2 += m % 3 == 2`
`94`	`91`	`if cnt2 > 1:`
`95`	`92`	`return False`
`96`		`- i = j`
`97`	`93`	`return cnt2 == 1`
`98`	`94`	```
`99`	`95`
`@@ -201,30 +197,4 @@ function isDecomposable(s: string): boolean {`
`201`	`197`
`202`	`198`	`<!-- solution:end -->`
`203`	`199`
`204`		`-<!-- solution:start -->`
`205`		`-`
`206`		`-### 方法二`
`207`		`-`
`208`		`-<!-- tabs:start -->`
`209`		`-`
`210`		`-#### Python3`
`211`		`-`
`212`		-```python
`213`		`-class Solution:`
`214`		`- def isDecomposable(self, s: str) -> bool:`
`215`		`- cnt2 = 0`
`216`		`- for _, g in groupby(s):`
`217`		`- m = len(list(g))`
`218`		`- if m % 3 == 1:`
`219`		`- return False`
`220`		`- cnt2 += m % 3 == 2`
`221`		`- if cnt2 > 1:`
`222`		`- return False`
`223`		`- return cnt2 == 1`
`224`		-```
`225`		`-`
`226`		`-<!-- tabs:end -->`
`227`		`-`
`228`		`-<!-- solution:end -->`
`229`		`-`
`230`	`200`	`<!-- problem:end -->`

Lines changed: 4 additions & 34 deletions

Original file line number	Diff line number	Diff line change
`@@ -83,18 +83,14 @@ The time complexity is $O(n),ドル where $n$ is the length of the string $s$. The sp`
`83`	`83`	```python
`84`	`84`	`class Solution:`
`85`	`85`	`def isDecomposable(self, s: str) -> bool:`
`86`		`- i, n = 0, len(s)`
`87`	`86`	`cnt2 = 0`
`88`		`- while i < n:`
`89`		`- j = i`
`90`		`- while j < n and s[j] == s[i]:`
`91`		`- j += 1`
`92`		`- if (j - i) % 3 == 1:`
	`87`	`+ for _, g in groupby(s):`
	`88`	`+ m = len(list(g))`
	`89`	`+ if m % 3 == 1:`
`93`	`90`	`return False`
`94`		`- cnt2 += (j - i) % 3 == 2`
	`91`	`+ cnt2 += m % 3 == 2`
`95`	`92`	`if cnt2 > 1:`
`96`	`93`	`return False`
`97`		`- i = j`
`98`	`94`	`return cnt2 == 1`
`99`	`95`	```
`100`	`96`
`@@ -202,30 +198,4 @@ function isDecomposable(s: string): boolean {`
`202`	`198`
`203`	`199`	`<!-- solution:end -->`
`204`	`200`
`205`		`-<!-- solution:start -->`
`206`		`-`
`207`		`-### Solution 2`
`208`		`-`
`209`		`-<!-- tabs:start -->`
`210`		`-`
`211`		`-#### Python3`
`212`		`-`
`213`		-```python
`214`		`-class Solution:`
`215`		`- def isDecomposable(self, s: str) -> bool:`
`216`		`- cnt2 = 0`
`217`		`- for _, g in groupby(s):`
`218`		`- m = len(list(g))`
`219`		`- if m % 3 == 1:`
`220`		`- return False`
`221`		`- cnt2 += m % 3 == 2`
`222`		`- if cnt2 > 1:`
`223`		`- return False`
`224`		`- return cnt2 == 1`
`225`		-```
`226`		`-`
`227`		`-<!-- tabs:end -->`
`228`		`-`
`229`		`-<!-- solution:end -->`
`230`		`-`
`231`	`201`	`<!-- problem:end -->`