feat: add typescript solution to lc problem: No.0724.Find Pivot Index

Author: zhaocchen

solution/0700-0799/0724.Find Pivot Index/README.md

@@ -103,6 +103,21 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function pivotIndex(nums: number[]): number {
+    let rightSum = nums.reduce((a, c) => a + c, 0),
+    leftSum = 0;
+    for (let i = 0; i < nums.length; i++) {
+        rightSum -= nums[i];
+        if (leftSum == rightSum) return i;
+        leftSum += nums[i];
+    }
+    return -1;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0700-0799/0724.Find Pivot Index/README_EN.md

@@ -91,6 +91,21 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function pivotIndex(nums: number[]): number {
+    let rightSum = nums.reduce((a, c) => a + c, 0),
+    leftSum = 0;
+    for (let i = 0; i < nums.length; i++) {
+        rightSum -= nums[i];
+        if (leftSum == rightSum) return i;
+        leftSum += nums[i];
+    }
+    return -1;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0700-0799/0724.Find Pivot Index/Solution.ts

@@ -0,0 +1,10 @@
+function pivotIndex(nums: number[]): number {
+    let rightSum = nums.reduce((a, c) => a + c, 0),
+    leftSum = 0;
+    for (let i = 0; i < nums.length; i++) {
+        rightSum -= nums[i];
+        if (leftSum == rightSum) return i;
+        leftSum += nums[i];
+    }
+    return -1;
+};