Commit 0faeb29

authored

feat: add solutions to lc problem: No.0419 (doocs#627)

No.0419.Battleships in a Board

1 parent 0ef4530 commit 0faeb29Copy full SHA for 0faeb29

File tree

+105

-4

lines changed

+105

-4

lines changed

Lines changed: 35 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -50,15 +50,48 @@ XXXX`
`50`	`50`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`51`	`51`
`52`	`52`	```python
`53`		`-`
	`53`	`+class Solution:`
	`54`	`+ def countBattleships(self, board: List[List[str]]) -> int:`
	`55`	`+ m, n = len(board), len(board[0])`
	`56`	`+ res = 0`
	`57`	`+ for i in range(m):`
	`58`	`+ for j in range(n):`
	`59`	`+ if board[i][j] == '.':`
	`60`	`+ continue`
	`61`	`+ if i > 0 and board[i - 1][j] == 'X':`
	`62`	`+ continue`
	`63`	`+ if j > 0 and board[i][j - 1] == 'X':`
	`64`	`+ continue`
	`65`	`+ res += 1`
	`66`	`+ return res`
`54`	`67`	```
`55`	`68`
`56`	`69`	`### Java`
`57`	`70`
`58`	`71`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`59`	`72`
`60`	`73`	```java
`61`		`-`
	`74`	`+class Solution {`
	`75`	`+ public int countBattleships(char[][] board) {`
	`76`	`+ int m = board.length, n = board[0].length;`
	`77`	`+ int res = 0;`
	`78`	`+ for (int i = 0; i < m; i++) {`
	`79`	`+ for (int j = 0; j < n; j++) {`
	`80`	`+ if (board[i][j] == '.') {`
	`81`	`+ continue;`
	`82`	`+ }`
	`83`	`+ if (i > 0 && board[i - 1][j] == 'X') {`
	`84`	`+ continue;`
	`85`	`+ }`
	`86`	`+ if (j > 0 && board[i][j - 1] == 'X') {`
	`87`	`+ continue;`
	`88`	`+ }`
	`89`	`+ res++;`
	`90`	`+ }`
	`91`	`+ }`
	`92`	`+ return res;`
	`93`	`+ }`
	`94`	`+}`
`62`	`95`	```
`63`	`96`
`64`	`97`	`### ...`

Lines changed: 35 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -44,13 +44,46 @@`
`44`	`44`	`### Python3`
`45`	`45`
`46`	`46`	```python
`47`		`-`
	`47`	`+class Solution:`
	`48`	`+ def countBattleships(self, board: List[List[str]]) -> int:`
	`49`	`+ m, n = len(board), len(board[0])`
	`50`	`+ res = 0`
	`51`	`+ for i in range(m):`
	`52`	`+ for j in range(n):`
	`53`	`+ if board[i][j] == '.':`
	`54`	`+ continue`
	`55`	`+ if i > 0 and board[i - 1][j] == 'X':`
	`56`	`+ continue`
	`57`	`+ if j > 0 and board[i][j - 1] == 'X':`
	`58`	`+ continue`
	`59`	`+ res += 1`
	`60`	`+ return res`
`48`	`61`	```
`49`	`62`
`50`	`63`	`### Java`
`51`	`64`
`52`	`65`	```java
`53`		`-`
	`66`	`+class Solution {`
	`67`	`+ public int countBattleships(char[][] board) {`
	`68`	`+ int m = board.length, n = board[0].length;`
	`69`	`+ int res = 0;`
	`70`	`+ for (int i = 0; i < m; i++) {`
	`71`	`+ for (int j = 0; j < n; j++) {`
	`72`	`+ if (board[i][j] == '.') {`
	`73`	`+ continue;`
	`74`	`+ }`
	`75`	`+ if (i > 0 && board[i - 1][j] == 'X') {`
	`76`	`+ continue;`
	`77`	`+ }`
	`78`	`+ if (j > 0 && board[i][j - 1] == 'X') {`
	`79`	`+ continue;`
	`80`	`+ }`
	`81`	`+ res++;`
	`82`	`+ }`
	`83`	`+ }`
	`84`	`+ return res;`
	`85`	`+ }`
	`86`	`+}`
`54`	`87`	```
`55`	`88`
`56`	`89`	`### ...`

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,21 @@`
	`1`	`+class Solution {`
	`2`	`+ public int countBattleships(char[][] board) {`
	`3`	`+ int m = board.length, n = board[0].length;`
	`4`	`+ int res = 0;`
	`5`	`+ for (int i = 0; i < m; i++) {`
	`6`	`+ for (int j = 0; j < n; j++) {`
	`7`	`+ if (board[i][j] == '.') {`
	`8`	`+ continue;`
	`9`	`+ }`
	`10`	`+ if (i > 0 && board[i - 1][j] == 'X') {`
	`11`	`+ continue;`
	`12`	`+ }`
	`13`	`+ if (j > 0 && board[i][j - 1] == 'X') {`
	`14`	`+ continue;`
	`15`	`+ }`
	`16`	`+ res++;`
	`17`	`+ }`
	`18`	`+ }`
	`19`	`+ return res;`
	`20`	`+ }`
	`21`	`+}`

Lines changed: 14 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,14 @@`
	`1`	`+class Solution:`
	`2`	`+ def countBattleships(self, board: List[List[str]]) -> int:`
	`3`	`+ m, n = len(board), len(board[0])`
	`4`	`+ res = 0`
	`5`	`+ for i in range(m):`
	`6`	`+ for j in range(n):`
	`7`	`+ if board[i][j] == '.':`
	`8`	`+ continue`
	`9`	`+ if i > 0 and board[i - 1][j] == 'X':`
	`10`	`+ continue`
	`11`	`+ if j > 0 and board[i][j - 1] == 'X':`
	`12`	`+ continue`
	`13`	`+ res += 1`
	`14`	`+ return res`

Comments

(0)