Reverse Words in a String
来源:互联网 发布:网络平台投稿 编辑:程序博客网 时间:2024/06/05 19:17
Given an input string, reverse the string word by word.
For example,
Given s = "the sky is blue
",
return "blue is sky the
".
public class Solution { public String reverseWords(String s) { //"\\s"表示空格,回车,换行等空白符,"+"表示一个或多个 String[] parts = s.trim().split("\\s+"); String out = ""; if (parts.length > 0) { for (int i = parts.length - 1; i > 0; i--) { out += parts[i] + " "; } out += parts[0]; } return out; }}
0 0
- Reverse words in a string.
- Reverse Words in a String
- Reverse Words in a String
- Reverse Words in a String
- Reverse Words in a String
- Reverse Words in a String
- Reverse Words in a String
- Reverse Words in a String
- Reverse Words in a String
- Reverse Words in a String
- Reverse Words in a String
- Reverse Words in a String
- Reverse Words in a String
- Reverse Words in a String
- Reverse Words in a String
- Reverse Words in a String
- Reverse Words in a String
- Reverse Words in a String
- 瀑布流
- Contains Duplicate III
- ios9 提交ipad出现bundle错误的解决方案
- Handler(原理) HandlerThread 轻松实现异步功能
- Android 5.1 Contacts源码分析(二):Contacts模块主要窗口
- Reverse Words in a String
- SearchView+RecyclerView+GreenDao的搜索功能实现(1)
- svn代码回滚和合并的利器svn merge
- redmine 和 github 集成
- C++ STL学习
- 六种方式实现hibernate查询
- struts2-validate内置校验器失效的解决方法
- svn import|export与svn ci|co
- 最小生成树总结(prim、并查集和kruskal) C++实现