字符串-Reverse Words in a String(翻转字符串)
来源:互联网 发布:linux patch 编辑:程序博客网 时间:2024/05/17 03:32
问题描述:
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.
思考:
关键在于对空格的剔除和对字符串的索引的把握,思路就是使用一个result字符串类累加保存结果,把顺序寻找的字符串添加在result的0位置上,那么后面的索引向后向后全部移动新字符串长度。
代码(java):
public class Solution { public String reverseWords(String s) { int begin = 0; int end = 0; if(s==null) { return s; } while(begin<s.length()&&s.charAt(begin)==' ') { begin++; } if(begin==s.length()) { return ""; } if(s.length()<=1) { return s; } StringBuilder result = new StringBuilder(""); while(begin<s.length()&&end<s.length()) { while(begin<s.length()&&s.charAt(begin)==' ') { begin++; } if(begin==s.length()) { break; } end = begin + 1; while(end<s.length()&&s.charAt(end)!=' ') { end++; } if(result.length()!=0) { result.insert(0," "); } if(end<s.length()) { result.insert(0,s.substring(begin,end)); } else { result.insert(0,s.substring(begin,end)); break; } begin = end + 1; } return result.toString(); }}
0 0
- Reverse Words in a String 翻转字符串
- 字符串-Reverse Words in a String(翻转字符串)
- 【LintCode】Reverse Words in a String 翻转字符串
- 151. Reverse Words in a String 翻转字符串中的单词
- leetcode 151. Reverse Words in a String 字符串 翻转
- 【LintCode】Reverse Words in a String 翻转字符串
- LeetCode刷题:Reverse Words in a String(翻转字符串中的单词)
- LeetCode OJ 之 Reverse Words in a String (翻转字符串的单词)
- 53.Reverse Words in a String-翻转字符串(容易题)
- LeetCode 557. Reverse Words in a String III (字符串翻转)
- 151. Reverse Words in a String 字符串
- 557. Reverse Words in a String III (字符串)
- Reverse Words in a String 翻转一个字符串里的单词顺序 @LeetCode
- leetcode151-Reverse Words in a String(翻转字符串单词的位置)
- 151.leetcode Reverse Words in a String(medium)[字符串分词翻转]
- Reverse Words in a String III 翻转字符串中的单词之三
- Reverse Words in a String(字符翻转)
- LeetCode Reverse Words in a String(反转字符串)
- 算法——排序(三)冒泡排序
- flexible.js 移动端自适应框架
- Android中补间动画在activity切换时使用
- 富文本编辑器-参考
- osg相机漫游
- 字符串-Reverse Words in a String(翻转字符串)
- 中介者模式
- selenium webdriver 学习总结-元素定位(一)
- 跳台阶问题:一个台阶共有N级,如果一次可以跳1级,也可跳2级,求总共有多少种跳法
- 三:深入理解Nginx的模块化 (结合源码详解)
- 【QTP】打开多个页面,多浏览器之间操作
- 临界销售计算
- 目标运动方向判断
- mysql高可用集群——MHA架构