Commit 9e4b42a

committed

feat: add typescript solution to lc problem: No.0917

No.0917.Reverse Only Letters

1 parent bb5a3f3 commit 9e4b42aCopy full SHA for 9e4b42a

File tree

+49

-0

lines changed

+49

-0

lines changed

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -114,6 +114,24 @@ class Solution {`
`114`	`114`	`}`
`115`	`115`	```
`116`	`116`
	`117`	`+### TypeScript`
	`118`	`+`
	`119`	+```ts
	`120`	`+function reverseOnlyLetters(s: string): string {`
	`121`	`+ const n = s.length;`
	`122`	`+ let i = 0, j = n - 1;`
	`123`	`+ let ans = [...s];`
	`124`	`+ while (i < j) {`
	`125`	`+ while (!/[a-zA-Z]/.test(ans[i]) && i < j) i++;`
	`126`	`+ while (!/[a-zA-Z]/.test(ans[j]) && i < j) j--;`
	`127`	`+ [ans[i], ans[j]] = [ans[j], ans[i]];`
	`128`	`+ i++;`
	`129`	`+ j--;`
	`130`	`+ }`
	`131`	`+ return ans.join('');`
	`132`	`+};`
	`133`	+```
	`134`	`+`
`117`	`135`	`### C++`
`118`	`136`
`119`	`137`	```cpp

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -82,6 +82,24 @@ class Solution {`
`82`	`82`	`}`
`83`	`83`	```
`84`	`84`
	`85`	`+### TypeScript`
	`86`	`+`
	`87`	+```ts
	`88`	`+function reverseOnlyLetters(s: string): string {`
	`89`	`+ const n = s.length;`
	`90`	`+ let i = 0, j = n - 1;`
	`91`	`+ let ans = [...s];`
	`92`	`+ while (i < j) {`
	`93`	`+ while (!/[a-zA-Z]/.test(ans[i]) && i < j) i++;`
	`94`	`+ while (!/[a-zA-Z]/.test(ans[j]) && i < j) j--;`
	`95`	`+ [ans[i], ans[j]] = [ans[j], ans[i]];`
	`96`	`+ i++;`
	`97`	`+ j--;`
	`98`	`+ }`
	`99`	`+ return ans.join('');`
	`100`	`+};`
	`101`	+```
	`102`	`+`
`85`	`103`	`### C++`
`86`	`104`
`87`	`105`	```cpp

Lines changed: 13 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,13 @@`
	`1`	`+function reverseOnlyLetters(s: string): string {`
	`2`	`+ const n = s.length;`
	`3`	`+ let i = 0, j = n - 1;`
	`4`	`+ let ans = [...s];`
	`5`	`+ while (i < j) {`
	`6`	`+ while (!/[a-zA-Z]/.test(ans[i]) && i < j) i++;`
	`7`	`+ while (!/[a-zA-Z]/.test(ans[j]) && i < j) j--;`
	`8`	`+ [ans[i], ans[j]] = [ans[j], ans[i]];`
	`9`	`+ i++;`
	`10`	`+ j--;`
	`11`	`+ }`
	`12`	`+ return ans.join('');`
	`13`	`+};`

Comments

(0)