- Iterative Approach
class Solution { public void reverseString(char[] s) { int left = 0, right = s.length - 1; while(left < right){ char temp = s[left]; s[left] = s[right]; s[right] = temp; left++; right--; } } }
- Recursive Approach
class Solution { public void reverseString(char[] s) { int i = 0, j = s.length - 1; helper(s, i, j); } private void helper(char[] s, int start, int end){ if(start >= end) return; helper(s, start + 1, end - 1); char temp = s[end]; s[end] = s[start]; s[start] = temp; } }
LeetCode 344. Reverse String
最新推荐文章于 2022-08-05 10:50:40 发布