File tree Expand file tree Collapse file tree 1 file changed +3
-3
lines changed Expand file tree Collapse file tree 1 file changed +3
-3
lines changed Original file line number Diff line number Diff line change @@ -83,9 +83,9 @@ Lets try to calculate the distance covered by both of the pointers till they poi
83
83
84
84
<center ></center >
85
85
86
- $slowDist = a + xL + b$ $x\ge0$
86
+ $slowDist = a + xL + b$ , $x\ge0$
87
87
88
- $fastDist = a + yL + b$ $y\ge0$
88
+ $fastDist = a + yL + b$ , $y\ge0$
89
89
90
90
- $slowDist$ is the total distance covered by slow pointer.
91
91
- $fastDist$ is the total distance covered by fast pointer.
@@ -94,7 +94,7 @@ $fastDist = a + yL + b$ $y\ge0$
94
94
- $x$ is the number of times the slow pointer has looped inside the cycle, starting from and ending at ** C** .
95
95
- $y$ is the number of times the fast pointer has looped inside the cycle, starting from and ending at ** C** .
96
96
97
- $slowDist = 2 \cdot (fastDist )$
97
+ $fastDist = 2 \cdot (slowDist )$
98
98
99
99
$a + yL + b = 2(a + xL + b)$
100
100
You can’t perform that action at this time.
0 commit comments