there is a dog 转换成 dog a is there

最新推荐文章于 2022-04-22 16:31:32 发布

菠萝菠萝菠萝葡萄

最新推荐文章于 2022-04-22 16:31:32 发布

阅读量194

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/weixin_44715313/article/details/116711602

版权

数据结构专栏收录该内容

15 篇文章 0 订阅

订阅专栏

参考：https://blog.csdn.net/dcjhyn/article/details/78073310?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522162079159916780269830573%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fall.%2522%257D&request_id=162079159916780269830573&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2_allfirst_rank_v2~rank_v29-2-78073310.first_rank_v2_pc_rank_v29&utm_term=there+is+a+dog

#include <iostream>
#include <stack>
#include<stdlib.h>
#include<string.h>
using namespace std;

char* _reverse(char *str)
{

    stack<char> v1;
    stack<char> v2;
	
	//求字符串长度
    int length = strlen(str);
    char *temp = str;


	//遍历字符串
    for (int i = 0; i < length+1; i++)
    {
    	//不为空，不为空格则压栈
        if(temp[i] != ' ' && temp[i] != '\0')
            v1.push(temp[i]);
        //如果为空或者，空格
        
        else{
        	//如果v1栈里有元素，则出栈，放入v2
            while (v1.size())
            {
                char ch = v1.top();
                v1.pop();
                v2.push(ch);
            }
            //如果i没到末尾，则对v2压入一个空格
            if (i < length-1)
                v2.push(' ');
        }
    }
	//把栈v2出栈到str
    for (int i = 0; i < length; i++)
    {
        str[i] = v2.top();
        v2.pop();
    }
    return str;
}

int main()
{
    char str[] = "this is a pre job";
    _reverse(str);
    cout << str <<endl;
    return 0;
}