算法天天練334：字元串翻轉

題目來源： https://leetcode.com/problems/reverse-string/

問題描述： 颠倒一個char數組裡面的字元串順序，隻能修改原始數組的值，不允許配置設定額外的空間。

舉例說明：

輸入	輸出
["h","e","l","l","o"]	["o","l","l","e","h"]
["H","a","n","n","a","h"]	["h","a","n","n","a","H"]

解決方案

1. 周遊數組後用中間變量交換元素位置，時間複雜度Ο(n)

class Solution {
    public void reverseString(char[] s) {
        int length = s.length;
        for(int i=0;i<length;i++) {
            if(i < (length-i-1)) {
              char temp = s[i];
              s[i] = s[length-i-1];
              s[length-i-1] = temp;
            }
        }
    }
    
}

           

作者：編碼磚家

公衆号：編碼磚家

出處：https://www.cnblogs.com/xiaoyangjia/

本文版權歸作者和部落格園共有，任何人或團體、機構全部轉載或者部分轉載、摘錄，請在文章明顯位置注明作者和原文連結。