[LeetCode]151.Reverse Words in a String
来源:互联网 发布:淘宝类目数据 编辑:程序博客网 时间:2024/06/01 08:40
题目
Given an input string, reverse the string word by word.
For example,
Given s = “the sky is blue”,
return “blue is sky the”.
Update (2015-02-12):
For C programmers: Try to solve it in-place in O(1) space.
click to show clarification.
Clarification:
What constitutes a word?
A sequence of non-space characters constitutes a word.
Could the input string contain leading or trailing spaces?
Yes. However, your reversed string should not contain leading or trailing spaces.
How about multiple spaces between two words?
Reduce them to a single space in the reversed string.
思路
两次反转法。这里注意单词之间的多个空格只留一个空格以及去掉前导0和后导0。
代码
/*---------------------------------------* 日期:2015-05-05* 作者:SJF0115* 题目: 151.Reverse Words in a String* 网址:https://leetcode.com/problems/reverse-words-in-a-string/* 结果:AC* 来源:LeetCode* 博客:-----------------------------------------*/#include <iostream>#include <vector>using namespace std;class Solution {public: void reverseWords(string &s) { int size = s.size(); if(size <= 0){ return; }//if // 前导0 int index = 0; while(s[index] == ' '){ ++index; }//while int left = index; // 后导0 index = size - 1; while(s[index] == ' '){ --index; }//while int right = index; // 连续空格只保留一个 for(int i = left;i <= right;){ if(i > left && s[i-1] == ' ' && s[i] == ' '){ s.erase(i-1,1); --right; }//if else{ ++i; } }//for // 翻转 int start = left,end = left; for(int i = left;i <= right+1;++i){ if(i == right+1 || s[i] == ' '){ Reverse(s,start,end-1); ++end; start = end; }//if else{ ++end; }//else }//for // 整体翻转 Reverse(s,left,right); s = s.substr(left,right - left + 1); }private: void Reverse(string &str,int start,int end){ for(int i = start,j = end;i < j;++i,--j){ swap(str[i],str[j]); }//for }};int main() { Solution solution; //string str(" abc cd ef "); string str(" a vvv "); solution.reverseWords(str); cout<<str<<endl;}
运行时间
代码二
/*---------------------------------------* 日期:2015-05-05* 作者:SJF0115* 题目: 151.Reverse Words in a String* 网址:https://leetcode.com/problems/reverse-words-in-a-string/* 结果:AC* 来源:LeetCode* 博客:-----------------------------------------*/#include <iostream>#include <algorithm>using namespace std;class Solution {public: void reverseWords(string &s) { int size = s.size(); if(size <= 0){ return; }//if int index = size - 1; string str; while(index >= 0){ // 空格 while(index >= 0 && s[index] == ' '){ --index; }//while if(index < 0){ break; }//if if(str.size() != 0){ str.push_back(' '); }//if string tmp; while(index >= 0 && s[index] != ' '){ tmp.push_back(s[index]); --index; }//while // 翻转 reverse(tmp.begin(),tmp.end()); str.append(tmp); }//while s = str; }};int main() { Solution solution; string str(" abc cd ef "); //string str(" a "); solution.reverseWords(str); cout<<str<<endl;}
运行时间
0 0
- LeetCode 151. Reverse Words in a String
- LeetCode 151. Reverse Words in a String
- [LeetCode]151.Reverse Words in a String
- [leetcode] 151.Reverse Words in a String
- Leetcode-151.Reverse Words in a String
- Leetcode 151. Reverse Words in a String
- [leetcode]151. Reverse Words in a String
- LeetCode 151. Reverse Words in a String
- Leetcode 151. Reverse Words in a String
- LeetCode *** 151. Reverse Words in a String
- LeetCode-151.Reverse Words in a String
- leetcode 151. Reverse Words in a String
- LeetCode - 151. Reverse Words in a String
- [leetcode] 151. Reverse Words in a String
- [Leetcode]151. Reverse Words in a String
- leetcode 151. Reverse Words in a String
- [LeetCode] 151. Reverse Words in a String
- Leetcode-151. Reverse Words in a String
- 总结20150505
- jsp传递数据给javascript
- javascript 学习笔记(1)对象和原型
- ssh-copy-id使用方法
- HTML基础2--a、img、常见标签、选择符、伪类
- [LeetCode]151.Reverse Words in a String
- Java相关环境配置(1)----JDK&JRE
- Trie树详解及其应用
- Search in Rotated Sorted Array II
- 提高第15课时,实践,简单银行系统的初步框架(加强版)v2.0
- PL/SQL基础
- ORM的使用
- IOS 数据库
- HTML基础3--内嵌、块元素