1 /** 2 * Created by sheepcore on 2019-02-24 3 */ 4 class Solution { 5 public void reverseString(char[] s) { 6 char ch; 7 for(int i=0; i<s.length/2; i++){ 8 ch = s[i]; 9 s[i] = s[s.length-1-i]; 10 s[s.length-1-i] = ch; 11 } 12 } 13 }
LeetCode-344 Reverse String Solution (with Java)
原文：https://www.cnblogs.com/sheepcore/p/12396124.html