力扣题:字符串的反转-11.21

力扣题-11.21

[力扣刷题攻略] Re:从零开始的力扣刷题生活

力扣题1:344. 反转字符串

解题思想:直接修改数组即可,前后互换顺序

力扣题:字符串的反转-11.21_第1张图片

class Solution(object):
    def reverseString(self, s):
        """
        :type s: List[str]
        :rtype: None Do not return anything, modify s in-place instead.
        """
        for i in range(len(s)/2):
            temp = s[i]
            s[i] = s[len(s)-i-1] 
            s[len(s)-i-1] = temp
class Solution {
public:
    void reverseString(vector<char>& s) {
        int temp = 0;
        for(int i=0;i<s.size()/2;i++){
            temp = s[i];
            s[i] = s[s.size()-1-i];
            s[s.size()-1-i] = temp;
        }
    }
};

你可能感兴趣的:(leetcode,算法,职场和发展)