feat: add ts solution to lc problem: No.2757 (doocs#1554)

Author: thinkasany

solution/2700-2799/2757.Generate Circular Array Values/README.md

@@ -80,11 +80,10 @@
 
 ```ts
 function* cycleGenerator(arr: number[], startIndex: number): Generator<number, void, number> {
-    let i = startIndex;
-    let x = yield arr[i];
+    const n = arr.length;
     while (true) {
-        i = (i + x + 10000 * arr.length) % arr.length;
-        x = yield arr[i];
+        const jump = yield arr[startIndex];
+        startIndex = (((startIndex + jump) % n) + n) % n;
     }
 }
 /**

solution/2700-2799/2757.Generate Circular Array Values/README_EN.md

@@ -72,11 +72,10 @@
 
 ```ts
 function* cycleGenerator(arr: number[], startIndex: number): Generator<number, void, number> {
-    let i = startIndex;
-    let x = yield arr[i];
+    const n = arr.length;
     while (true) {
-        i = (i + x + 10000 * arr.length) % arr.length;
-        x = yield arr[i];
+        const jump = yield arr[startIndex];
+        startIndex = (((startIndex + jump) % n) + n) % n;
     }
 }
 /**

solution/2700-2799/2757.Generate Circular Array Values/Solution.ts

@@ -1,11 +1,11 @@
 function* cycleGenerator(arr: number[], startIndex: number): Generator<number, void, number> {
-    let i = startIndex;
-    let x = yield arr[i];
+    const n = arr.length;
     while (true) {
-        i = (i + x + 10000 * arr.length) % arr.length;
-        x = yield arr[i];
+        const jump = yield arr[startIndex];
+        startIndex = (((startIndex + jump) % n) + n) % n;
     }
 }
+
 /**
  *  const gen = cycleGenerator([1,2,3,4,5], 0);
  *  gen.next().value  // 1