update: 38

Author: hijiangtao

README.md

@@ -33,6 +33,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 | 33 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [JavaScript](./src/search-in-rotated-sorted-array/res.js) | Medium |
 | 34 | [Search for a Range](https://leetcode.com/problems/search-for-a-range/) | [JavaScript](./src/search-for-a-range/res.js) | Medium |
 | 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [JavaScript](./src/search-insert-position/res.js) | Easy |
+| 38 | [count-and-say](https://leetcode.com/problems/count-and-say/) | [TypeScript](./src/count-and-say/res.ts) | Medium |
 | 39 | [Combination Sum](https://leetcode.com/problems/combination-sum/) | [JavaScript](./src/combination-sum/res.js) | Medium |
 | 40 | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii/) | [JavaScript](./src/combination-sum-ii/res.js) | Medium |
 | 41 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/description/) | [JavaScript](./src/first-missing-positive/res.js) | Hard |

src/count-and-say/res.ts

@@ -0,0 +1,28 @@
+function countAndSay(n: number): string {
+let result = '1';
+
+for (let i = 1; i < n; i++) {
+let newResult: string = '';
+let stackList: string[] = result.split('');
+
+let currentCount = 1;
+let currentChar = stackList[0];
+for (let j = 1; j < stackList.length; j++) {
+if (currentChar === stackList[j]) {
+currentCount++;
+} else {
+newResult += `${currentCount}${currentChar}`;
+currentChar = stackList[j];
+currentCount = 1;
+}
+}
+
+if (currentCount) {
+newResult += `${currentCount}${currentChar}`;
+}
+
+result = newResult;
+}
+
+return result;
+};