Commit 4ad6095

authored

Improved task 864.

1 parent 509a013 commit 4ad6095Copy full SHA for 4ad6095

File tree

-6

lines changed

-6

lines changed

Lines changed: 4 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,7 +5,6 @@`
`5`	`5`	`import java.util.LinkedList;`
`6`	`6`	`import java.util.Queue;`
`7`	`7`
`8`		`-@SuppressWarnings("java:S135")`
`9`	`8`	`public class Solution {`
`10`	`9`	`private int m;`
`11`	`10`	`private int n;`
`@@ -76,11 +75,10 @@ public int shortestPathAllKeys(String[] stringGrid) {`
`76`	`75`	`// use & to see if we have the key`
`77`	`76`	`// 0 means that the digit we are looking at is 0`
`78`	`77`	`// need a 1 at the digit spot which means there is a key there`
`79`		`- if ('A' <= grid[nx][ny]`
`80`		`- && grid[nx][ny] <= 'F'`
`81`		`- && ((nState & (1 << (grid[nx][ny] - 'A'))) == 0)) {`
`82`		`- continue;`
`83`		`- } else if (!visited[nx][ny][nState]) {`
	`78`	`+ if (('A' > grid[nx][ny]`
	`79`	`+ \|\| grid[nx][ny] > 'F'`
	`80`	`+ \|\| ((nState & (1 << (grid[nx][ny] - 'A'))) != 0))`
	`81`	`+ && !visited[nx][ny][nState]) {`
`84`	`82`	`q.add(new int[] {nx, ny, nState});`
`85`	`83`	`visited[nx][ny][nState] = true;`
`86`	`84`	`}`

Comments

(0)