feat: add typescript solution to lc problem: No.0162.Find Peak Element (

doocs#463)
WindChenCC · Jun 21, 2021 · 1b9d507 · 1b9d507
1 parent 0105f30
commit 1b9d507
Show file tree

Hide file tree

Showing 3 changed files with 46 additions and 0 deletions.
diff --git a/solution/0100-0199/0162.Find Peak Element/README.md b/solution/0100-0199/0162.Find Peak Element/README.md
@@ -90,6 +90,23 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findPeakElement(nums: number[]): number {
+    let left = 0, right = nums.length - 1;
+    while (left < right) {
+        let mid: number = (left + right) >> 1;
+        if (nums[mid] <= nums[mid+1]) {
+            left = mid +1;
+        } else {
+            right = mid;
+        }
+    }
+    return left;
+};
+```
+
 ### **Go**
 
 ```go

diff --git a/solution/0100-0199/0162.Find Peak Element/README_EN.md b/solution/0100-0199/0162.Find Peak Element/README_EN.md
@@ -77,6 +77,23 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findPeakElement(nums: number[]): number {
+    let left = 0, right = nums.length - 1;
+    while (left < right) {
+        let mid: number = (left + right) >> 1;
+        if (nums[mid] <= nums[mid+1]) {
+            left = mid +1;
+        } else {
+            right = mid;
+        }
+    }
+    return left;
+};
+```
+
 ### **Go**
 
 ```go

diff --git a/solution/0100-0199/0162.Find Peak Element/Solution.ts b/solution/0100-0199/0162.Find Peak Element/Solution.ts
@@ -0,0 +1,12 @@
+function findPeakElement(nums: number[]): number {
+    let left = 0, right = nums.length - 1;
+    while (left < right) {
+        let mid: number = (left + right) >> 1;
+        if (nums[mid] <= nums[mid+1]) {
+            left = mid +1;
+        } else {
+            right = mid;
+        }
+    }
+    return left;
+};