【20221226】【剑指1】字符串

最新推荐文章于 2024-07-17 23:24:38 发布

好像也没什么大不了

最新推荐文章于 2024-07-17 23:24:38 发布

阅读量60

点赞数

分类专栏：剑指offer系列文章标签：算法 leetcode 数据结构

本文链接：https://blog.csdn.net/HYAIWYH/article/details/128447253

版权

剑指offer系列专栏收录该内容

24 篇文章 0 订阅

订阅专栏

1、替换空格

先确定空格数量，再用双指针法，从后往前遍历。

https://blog.csdn.net/HYAIWYH/article/details/127375267?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522167204741116782427432389%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fblog.%2522%257D&request_id=167204741116782427432389&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~blog~first_rank_ecpm_v1~rank_v31_ecpm-1-127375267-null-null.blog_rank_default&utm_term=%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC&spm=1018.2226.3001.4450https://blog.csdn.net/HYAIWYH/article/details/127375267?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522167204741116782427432389%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fblog.%2522%257D&request_id=167204741116782427432389&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~blog~first_rank_ecpm_v1~rank_v31_ecpm-1-127375267-null-null.blog_rank_default&utm_term=%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC&spm=1018.2226.3001.4450

class Solution {
public:
    string replaceSpace(string s) {
        //先寻找空格数量
        int length=s.size();
        int spaceCount=0;
        for(int i=0;i<s.size();i++)
        {
            if(s[i]==' ')   spaceCount++;
        }
        s.resize(length+2*spaceCount);
        int j=s.size()-1;
        for(int i=length-1;i>=0;i--)
        {
            if(s[i]==' ')   
            {
                s[j]='0';
                s[j-1]='2';
                s[j-2]='%';
                j-=3;
            }
            else
            {
                s[j]=s[i];
                j--;
            }
        }
        return s;
    }
};

2、左旋转字符串

翻转3次字符串https://blog.csdn.net/HYAIWYH/article/details/127413504?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522167204788016800188513489%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fblog.%2522%257D&request_id=167204788016800188513489&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~blog~first_rank_ecpm_v1~rank_v31_ecpm-1-127413504-null-null.blog_rank_default&utm_term=%E5%B7%A6%E6%97%8B%E8%BD%AC&spm=1018.2226.3001.4450https://blog.csdn.net/HYAIWYH/article/details/127413504?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522167204788016800188513489%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fblog.%2522%257D&request_id=167204788016800188513489&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~blog~first_rank_ecpm_v1~rank_v31_ecpm-1-127413504-null-null.blog_rank_default&utm_term=%E5%B7%A6%E6%97%8B%E8%BD%AC&spm=1018.2226.3001.4450

class Solution {
public:
    void reverse(string& s,int start,int end){
        while(start<end)
        {
            swap(s[start],s[end]);
            start++;
            end--;
        }
    }
    string reverseLeftWords(string s, int n) {
        reverse(s,0,n-1);
        reverse(s,n,s.size()-1);
        reverse(s,0,s.size()-1);
        return s;
    }
};