Commit d1a2066

committed

feat: add solution to lc problem: No.0488

No.0488.Zuma Game

1 parent 626d528 commit d1a2066Copy full SHA for d1a2066

File tree

+75

-2

lines changed

+75

-2

lines changed

Lines changed: 25 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -69,7 +69,31 @@`
`69`	`69`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`70`	`70`
`71`	`71`	```python
`72`		`-`
	`72`	`+class Solution:`
	`73`	`+ def findMinStep(self, board: str, hand: str) -> int:`
	`74`	`+ def remove(s):`
	`75`	`+ while len(s):`
	`76`	`+ next = re.sub(r'B{3,}\|G{3,}\|R{3,}\|W{3,}\|Y{3,}', '', s)`
	`77`	`+ if len(next) == len(s):`
	`78`	`+ break`
	`79`	`+ s = next`
	`80`	`+ return s`
	`81`	`+`
	`82`	`+ visited = set()`
	`83`	`+ q = deque([(board, hand)])`
	`84`	`+ while q:`
	`85`	`+ state, balls = q.popleft()`
	`86`	`+ if not state:`
	`87`	`+ return len(hand) - len(balls)`
	`88`	`+ for ball in set(balls):`
	`89`	`+ b = balls.replace(ball, '', 1)`
	`90`	`+ for i in range(1, len(state) + 1):`
	`91`	`+ s = state[:i] + ball + state[i:]`
	`92`	`+ s = remove(s)`
	`93`	`+ if s not in visited:`
	`94`	`+ visited.add(s)`
	`95`	`+ q.append((s, b))`
	`96`	`+ return -1`
`73`	`97`	```
`74`	`98`
`75`	`99`	`### Java`

Lines changed: 25 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -61,7 +61,31 @@`
`61`	`61`	`### Python3`
`62`	`62`
`63`	`63`	```python
`64`		`-`
	`64`	`+class Solution:`
	`65`	`+ def findMinStep(self, board: str, hand: str) -> int:`
	`66`	`+ def remove(s):`
	`67`	`+ while len(s):`
	`68`	`+ next = re.sub(r'B{3,}\|G{3,}\|R{3,}\|W{3,}\|Y{3,}', '', s)`
	`69`	`+ if len(next) == len(s):`
	`70`	`+ break`
	`71`	`+ s = next`
	`72`	`+ return s`
	`73`	`+`
	`74`	`+ visited = set()`
	`75`	`+ q = deque([(board, hand)])`
	`76`	`+ while q:`
	`77`	`+ state, balls = q.popleft()`
	`78`	`+ if not state:`
	`79`	`+ return len(hand) - len(balls)`
	`80`	`+ for ball in set(balls):`
	`81`	`+ b = balls.replace(ball, '', 1)`
	`82`	`+ for i in range(1, len(state) + 1):`
	`83`	`+ s = state[:i] + ball + state[i:]`
	`84`	`+ s = remove(s)`
	`85`	`+ if s not in visited:`
	`86`	`+ visited.add(s)`
	`87`	`+ q.append((s, b))`
	`88`	`+ return -1`
`65`	`89`	```
`66`	`90`
`67`	`91`	`### Java`

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,25 @@`
	`1`	`+class Solution:`
	`2`	`+ def findMinStep(self, board: str, hand: str) -> int:`
	`3`	`+ def remove(s):`
	`4`	`+ while len(s):`
	`5`	`+ next = re.sub(r'B{3,}\|G{3,}\|R{3,}\|W{3,}\|Y{3,}', '', s)`
	`6`	`+ if len(next) == len(s):`
	`7`	`+ break`
	`8`	`+ s = next`
	`9`	`+ return s`
	`10`	`+`
	`11`	`+ visited = set()`
	`12`	`+ q = deque([(board, hand)])`
	`13`	`+ while q:`
	`14`	`+ state, balls = q.popleft()`
	`15`	`+ if not state:`
	`16`	`+ return len(hand) - len(balls)`
	`17`	`+ for ball in set(balls):`
	`18`	`+ b = balls.replace(ball, '', 1)`
	`19`	`+ for i in range(1, len(state) + 1):`
	`20`	`+ s = state[:i] + ball + state[i:]`
	`21`	`+ s = remove(s)`
	`22`	`+ if s not in visited:`
	`23`	`+ visited.add(s)`
	`24`	`+ q.append((s, b))`
	`25`	`+ return -1`

Comments

(0)