Skip to content

Solution for 1728. #1848

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 22 commits into from
Oct 19, 2023
Merged

Solution for 1728. #1848

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
22 commits
Select commit Hold shift + click to select a range
ef6cff5
Added Solution for 1912. Movie Rental System in python.
nrhitik Oct 14, 2023
ca705c1
Update README.md
yanglbme Oct 15, 2023
727bd2c
Update README_EN.md
yanglbme Oct 15, 2023
d1241ab
Update Solution.py
yanglbme Oct 15, 2023
5ac39c3
Merge branch 'doocs:main' into main
nrhitik Oct 15, 2023
a02c409
Solution for 1900. Earliest and Latest Rounds Where Players Compete.
nrhitik Oct 15, 2023
c530b16
Merge branch 'main' into main
nrhitik Oct 15, 2023
24457d6
Merge branch 'main' into main
nrhitik Oct 16, 2023
11ee104
Merge branch 'doocs:main' into main
nrhitik Oct 16, 2023
dd85b2c
Added Solution for 1307. Verbal Arithmetic Puzzel and Updated README.…
nrhitik Oct 16, 2023
cce5b39
Added solution for 1354.
nrhitik Oct 16, 2023
1ba8be6
Merge branch 'main' into main
nrhitik Oct 16, 2023
b1d5882
Updated solution for 1307 to pass all the test cases.
nrhitik Oct 16, 2023
aa585c8
Merge branch 'main' of https://github.com/nrhitik/leetcode
nrhitik Oct 16, 2023
ea51913
Updated README for 1307.
nrhitik Oct 16, 2023
9d9cc9b
Merge branch 'main' into main
nrhitik Oct 17, 2023
f06d35e
Merge branch 'main' into main
nrhitik Oct 17, 2023
68821c3
Removed solution for 1307.
nrhitik Oct 18, 2023
00027e9
Merge branch 'main' of https://github.com/nrhitik/leetcode
nrhitik Oct 18, 2023
45b34c5
Merge branch 'main' into main
nrhitik Oct 18, 2023
54ba9ac
Solution for 1728.
nrhitik Oct 19, 2023
fac1994
Merge branch 'doocs:main' into main
nrhitik Oct 19, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
70 changes: 70 additions & 0 deletions solution/1700-1799/1728.Cat and Mouse II/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -105,6 +105,76 @@
<!-- 这里可写当前语言的特殊实现逻辑 -->

```python
class Solution:
def canMouseWin(self, grid: List[str], catJump: int, mouseJump: int) -> bool:
dirs = [0, 1, 0, -1, 0]
m = len(grid)
n = len(grid[0])
nFloors = 0
cat = 0 # cat's position
mouse = 0 # mouse's position

def hash(i: int, j: int) -> int:
return i * n + j

for i in range(m):
for j in range(n):
if grid[i][j] != "#":
nFloors += 1
if grid[i][j] == "C":
cat = hash(i, j)
elif grid[i][j] == "M":
mouse = hash(i, j)

# dp(i, j, k) := True if mouse can win w//
# Cat on (i // 8, i % 8), mouse on (j // 8, j % 8), and turns = k
@functools.lru_cache(None)
def dp(cat: int, mouse: int, turn: int) -> bool:
# We already search whole touchable grid
if turn == nFloors * 2:
return False

if turn % 2 == 0:
# mouse's turn
i = mouse // n
j = mouse % n
for k in range(4):
for jump in range(mouseJump + 1):
x = i + dirs[k] * jump
y = j + dirs[k + 1] * jump
if x < 0 or x == m or y < 0 or y == n:
break
if grid[x][y] == "#":
break
if grid[x][y] == "F": # Mouse eats the food, so mouse win
return True
if dp(cat, hash(x, y), turn + 1):
return True
# Mouse can't win, so mouse lose
return False
else:
# cat's turn
i = cat // n
j = cat % n
for k in range(4):
for jump in range(catJump + 1):
x = i + dirs[k] * jump
y = j + dirs[k + 1] * jump
if x < 0 or x == m or y < 0 or y == n:
break
if grid[x][y] == "#":
break
if grid[x][y] == "F": # Cat eats the food, so mouse lose
return False
nextCat = hash(x, y)
if nextCat == mouse: # Cat catches mouse, so mouse lose
return False
if not dp(nextCat, mouse, turn + 1):
return False
# Cat can't win, so mouse win
return True

return dp(cat, mouse, 0)

```

Expand Down
70 changes: 70 additions & 0 deletions solution/1700-1799/1728.Cat and Mouse II/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -79,6 +79,76 @@
### **Python3**

```python
class Solution:
def canMouseWin(self, grid: List[str], catJump: int, mouseJump: int) -> bool:
dirs = [0, 1, 0, -1, 0]
m = len(grid)
n = len(grid[0])
nFloors = 0
cat = 0 # cat's position
mouse = 0 # mouse's position

def hash(i: int, j: int) -> int:
return i * n + j

for i in range(m):
for j in range(n):
if grid[i][j] != "#":
nFloors += 1
if grid[i][j] == "C":
cat = hash(i, j)
elif grid[i][j] == "M":
mouse = hash(i, j)

# dp(i, j, k) := True if mouse can win w//
# Cat on (i // 8, i % 8), mouse on (j // 8, j % 8), and turns = k
@functools.lru_cache(None)
def dp(cat: int, mouse: int, turn: int) -> bool:
# We already search whole touchable grid
if turn == nFloors * 2:
return False

if turn % 2 == 0:
# mouse's turn
i = mouse // n
j = mouse % n
for k in range(4):
for jump in range(mouseJump + 1):
x = i + dirs[k] * jump
y = j + dirs[k + 1] * jump
if x < 0 or x == m or y < 0 or y == n:
break
if grid[x][y] == "#":
break
if grid[x][y] == "F": # Mouse eats the food, so mouse win
return True
if dp(cat, hash(x, y), turn + 1):
return True
# Mouse can't win, so mouse lose
return False
else:
# cat's turn
i = cat // n
j = cat % n
for k in range(4):
for jump in range(catJump + 1):
x = i + dirs[k] * jump
y = j + dirs[k + 1] * jump
if x < 0 or x == m or y < 0 or y == n:
break
if grid[x][y] == "#":
break
if grid[x][y] == "F": # Cat eats the food, so mouse lose
return False
nextCat = hash(x, y)
if nextCat == mouse: # Cat catches mouse, so mouse lose
return False
if not dp(nextCat, mouse, turn + 1):
return False
# Cat can't win, so mouse win
return True

return dp(cat, mouse, 0)

```

Expand Down
70 changes: 70 additions & 0 deletions solution/1700-1799/1728.Cat and Mouse II/Solution.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,70 @@
class Solution:
def canMouseWin(self, grid: List[str], catJump: int, mouseJump: int) -> bool:
dirs = [0, 1, 0, -1, 0]
m = len(grid)
n = len(grid[0])
nFloors = 0
cat = 0 # cat's position
mouse = 0 # mouse's position

def hash(i: int, j: int) -> int:
return i * n + j

for i in range(m):
for j in range(n):
if grid[i][j] != "#":
nFloors += 1
if grid[i][j] == "C":
cat = hash(i, j)
elif grid[i][j] == "M":
mouse = hash(i, j)

# dp(i, j, k) := True if mouse can win w//
# Cat on (i // 8, i % 8), mouse on (j // 8, j % 8), and turns = k
@functools.lru_cache(None)
def dp(cat: int, mouse: int, turn: int) -> bool:
# We already search whole touchable grid
if turn == nFloors * 2:
return False

if turn % 2 == 0:
# mouse's turn
i = mouse // n
j = mouse % n
for k in range(4):
for jump in range(mouseJump + 1):
x = i + dirs[k] * jump
y = j + dirs[k + 1] * jump
if x < 0 or x == m or y < 0 or y == n:
break
if grid[x][y] == "#":
break
if grid[x][y] == "F": # Mouse eats the food, so mouse win
return True
if dp(cat, hash(x, y), turn + 1):
return True
# Mouse can't win, so mouse lose
return False
else:
# cat's turn
i = cat // n
j = cat % n
for k in range(4):
for jump in range(catJump + 1):
x = i + dirs[k] * jump
y = j + dirs[k + 1] * jump
if x < 0 or x == m or y < 0 or y == n:
break
if grid[x][y] == "#":
break
if grid[x][y] == "F": # Cat eats the food, so mouse lose
return False
nextCat = hash(x, y)
if nextCat == mouse: # Cat catches mouse, so mouse lose
return False
if not dp(nextCat, mouse, turn + 1):
return False
# Cat can't win, so mouse win
return True

return dp(cat, mouse, 0)