diff --git a/problems/0344.反转字符串.md b/problems/0344.反转字符串.md
index e1f27bd7..3198f856 100644
--- a/problems/0344.反转字符串.md
+++ b/problems/0344.反转字符串.md
@@ -266,6 +266,38 @@ public class Solution
     }
 }
 ```
+
+
+PHP：
+```php
+// 双指针
+// 一：
+function reverseString(&$s) {
+    $left = 0;
+    $right = count($s)-1;
+    while($left<$right){
+        $temp = $s[$left];
+        $s[$left] = $s[$right];
+        $s[$right] = $temp;
+        $left++;
+        $right--;
+    }
+}
+
+// 二：
+function reverseString(&$s) {
+    $this->reverse($s,0,count($s)-1);
+}
+// 按指定位置交换元素
+function reverse(&$s, $start, $end) {
+    for ($i = $start, $j = $end; $i < $j; $i++, $j--) {
+        $tmp = $s[$i];
+        $s[$i] = $s[$j];
+        $s[$j] = $tmp;
+    }
+    }
+```
+
 Scala:
 ```scala
 object Solution {
diff --git a/problems/0941.有效的山脉数组.md b/problems/0941.有效的山脉数组.md
index 4b7a978c..7004e84c 100644
--- a/problems/0941.有效的山脉数组.md
+++ b/problems/0941.有效的山脉数组.md
@@ -157,6 +157,26 @@ var validMountainArray = function(arr) {
 };
 ```
 
+## TypeScript
+
+```typescript
+function validMountainArray(arr: number[]): boolean {
+    const length: number = arr.length;
+    if (length < 3) return false;
+    let left: number = 0,
+        right: number = length - 1;
+    while (left < (length - 1) && arr[left] < arr[left + 1]) {
+        left++;
+    }
+    while (right > 0 && arr[right] < arr[right - 1]) {
+        right--;
+    }
+    if (left === right && left !== 0 && right !== length - 1)
+        return true;
+    return false;
+};
+```
+