山东最新通知今天网站seo基础优化
题目：
题解：
class Solution {public void reverseString(char[] s) {int n = s.length;for (int left = 0, right = n - 1; left < right; ++left, --right) {char tmp = s[left];s[left] = s[right];s[right] = tmp;}}
}
题目：
题解：
class Solution {public void reverseString(char[] s) {int n = s.length;for (int left = 0, right = n - 1; left < right; ++left, --right) {char tmp = s[left];s[left] = s[right];s[right] = tmp;}}
}