rename a varaible in 1377

fishercoder1534 · fishercoder1534 · commit a27e39bc9aba · 2020-03-08T09:49:54.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1377.java b/src/main/java/com/fishercoder/solutions/_1377.java
@@ -67,16 +67,16 @@ public double frogPosition(int n, int[][] edges, int t, int target) {
                 for (int i = queue.size(); i > 0; i--) {
                     int vertex = queue.poll();
                     int nextVerticesCount = 0;
-                    for (int v : graph[vertex]) {
-                        if (!visited[v]) {
+                    for (int next : graph[vertex]) {
+                        if (!visited[next]) {
                             nextVerticesCount++;
                         }
                     }
-                    for (int v : graph[vertex]) {
-                        if (!visited[v]) {
-                            visited[v] = true;
-                            queue.offer(v);
-                            probabilities[v] = probabilities[vertex] / nextVerticesCount;
+                    for (int next : graph[vertex]) {
+                        if (!visited[next]) {
+                            visited[next] = true;
+                            queue.offer(next);
+                            probabilities[next] = probabilities[vertex] / nextVerticesCount;
                         }
                     }
                     if (nextVerticesCount > 0) {

Original file line number	Diff line number	Diff line change
`@@ -67,16 +67,16 @@ public double frogPosition(int n, int[][] edges, int t, int target) {`
`67`	`67`	`for (int i = queue.size(); i > 0; i--) {`
`68`	`68`	`int vertex = queue.poll();`
`69`	`69`	`int nextVerticesCount = 0;`
`70`		`- for (int v : graph[vertex]) {`
`71`		`- if (!visited[v]) {`
	`70`	`+ for (int next : graph[vertex]) {`
	`71`	`+ if (!visited[next]) {`
`72`	`72`	`nextVerticesCount++;`
`73`	`73`	`}`
`74`	`74`	`}`
`75`		`- for (int v : graph[vertex]) {`
`76`		`- if (!visited[v]) {`
`77`		`- visited[v] = true;`
`78`		`- queue.offer(v);`
`79`		`- probabilities[v] = probabilities[vertex] / nextVerticesCount;`
	`75`	`+ for (int next : graph[vertex]) {`
	`76`	`+ if (!visited[next]) {`
	`77`	`+ visited[next] = true;`
	`78`	`+ queue.offer(next);`
	`79`	`+ probabilities[next] = probabilities[vertex] / nextVerticesCount;`
`80`	`80`	`}`
`81`	`81`	`}`
`82`	`82`	`if (nextVerticesCount > 0) {`