feat: add solutions to lc problems: No.1041

Author: thinkasany

solution/1000-1099/1041.Robot Bounded In Circle/README.md

@@ -178,6 +178,28 @@ func isRobotBounded(instructions string) bool {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function isRobotBounded(instructions: string): boolean {
+    const direction = new Array(4).fill(0);
+    let cur = 0;
+    for (const c of instructions.split('')) {
+        if (c === 'L') {
+            cur = (cur + 1) % 4;
+        } else if (c === 'R') {
+            cur = (cur + 3) % 4;
+        } else {
+            ++direction[cur];
+        }
+    }
+    return (
+        cur !== 0 ||
+        (direction[0] === direction[2] && direction[1] === direction[3])
+    );
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1041.Robot Bounded In Circle/README_EN.md

@@ -163,6 +163,28 @@ func isRobotBounded(instructions string) bool {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function isRobotBounded(instructions: string): boolean {
+    const direction = new Array(4).fill(0);
+    let cur = 0;
+    for (const c of instructions.split('')) {
+        if (c === 'L') {
+            cur = (cur + 1) % 4;
+        } else if (c === 'R') {
+            cur = (cur + 3) % 4;
+        } else {
+            ++direction[cur];
+        }
+    }
+    return (
+        cur !== 0 ||
+        (direction[0] === direction[2] && direction[1] === direction[3])
+    );
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1041.Robot Bounded In Circle/Solution.ts

@@ -0,0 +1,17 @@
+function isRobotBounded(instructions: string): boolean {
+    const direction = new Array(4).fill(0);
+    let cur = 0;
+    for (const c of instructions.split('')) {
+        if (c === 'L') {
+            cur = (cur + 1) % 4;
+        } else if (c === 'R') {
+            cur = (cur + 3) % 4;
+        } else {
+            ++direction[cur];
+        }
+    }
+    return (
+        cur !== 0 ||
+        (direction[0] === direction[2] && direction[1] === direction[3])
+    );
+}