代码随想录刷题第八天

最新推荐文章于 2024-09-27 15:30:00 发布

气氛组阿宇

最新推荐文章于 2024-09-27 15:30:00 发布

阅读量62

点赞数

文章标签： leetcode 算法 c++

本文链接：https://blog.csdn.net/Bi11y/article/details/128885254

版权

代码随想录刷题第八天

344. 反转字符串 - 力扣（LeetCode）

class Solution {
public:
    void my_swap(char &a, char &b){
        char tmp;
        tmp = a;
        a= b;
        b = tmp;
    }
    void reverseString(vector<char>& s) {
        int left = 0;
        int right = s.size()-1;
        while(left < right){
            my_swap(s[left],s[right]);
            left++;
            right--;
        }
    }
};

反转字符串 II

/*
* @lc app=leetcode.cn id=541 lang=cpp
*
* [541] 反转字符串 II
*/
// @lc code=start
#include<iostream>
#include<string>
using namespace std;
class Solution {
public:
    string reverseStr(string s, int k) {
       int board = 0;
       while (board < s.size())
       {
        //第一种情况 size < k 全部翻转
        if (board+k > s.size())
        {
            reverse(s.begin() + board,s.end());
        }else
        {
            reverse(s.begin()+board,s.begin()+board+k);
        }
        board += 2*k;
       }
        return s;
    }
};
// @lc code=end

剑指 Offer 05. 替换空格 - 力扣（LeetCode）

class Solution {
public:
    string replaceSpace(string s) {
        int len = 0;
        int m = s.size();
        for(int i = 0; i < s.size(); i++ ){
            if(s[i] == ' '){
                len++;
            }
        }
        len = s.size()+2*len;
        //s.resize(len);
        int j = 0,n = 0;
        string t(len,0);
        while(j <= s.size()){
            if(s[j] == ' '){
                t[n] = '%';
                t[n+1] = '2';
                t[n+2] = '0';   
                j++;
                n+=3;
            }else{
                t[n] = s[j];
                n++;
                j++;
            }
        }
        return t;
    }
};

反转字符串中的单词

#include<iostream>
#include<string>
using namespace std;

class Solution {
public:
    void removespace(string &s){
        int slow = 0;
        for (int i = 0; i < s.size(); i++)
        {
            if (s[i] != ' ')
            {
                if(slow != 0) s[slow++] = ' ';
                while (s[i] != ' ' && i < s.size())
                {
                    s[slow++] = s[i++]; 
                }
                
            }
            
        }
        s.resize(slow);
    }

    void reverse(string& s, int start, int end) {
    for (int i = start, j = end; i < j; i++, j--) {
        swap(s[i], s[j]);
    }
}

    string reverseWords(string s) {
        removespace(s);
        reverse(s,0,s.size()-1);
        int start = 0;
        for (int i = 0; i < s.size(); i++)
        {
            /* code */
            if (i == s.size() || s[i] == ' ' )
            {
                            
            reverse(s,start,i-1);
            start = i+1;
            }

        }
        return s;
    }
};

剑指 Offer 58 - II. 左旋转字符串

class Solution {
public:
    string reverseLeftWords(string s, int n) {
        string tmp(n,'0');
        for(int i = 0; i < n; i++){
            tmp[i] = s[i];
        }
        int slow = 0;
        for(int i = n; i < s.size(); i++){
            s[slow++] = s[i];
        }
        int index = 0;
        for(int i = s.size() - n;i<s.size(); i++){
            s[i] = tmp[index++];
        }
        return s;
    }
};