首页 > 代码库 > Reverse Words in a String 翻转一个字符串里的单词顺序 @LeetCode
Reverse Words in a String 翻转一个字符串里的单词顺序 @LeetCode
LeetCode新题,但是比较简单,直接用栈即可
Given an input string, reverse the string word by word.
For example,
Given s = "the sky is blue
",
return "blue is sky the
".
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.
public class Solution { public String reverseWords(String s) { if(s.length() == 0) { return s; } Stack<String> stack = new Stack<String>(); String[] ss = s.split("\\s+"); for(String word : ss) { stack.push(word); } StringBuilder sb = new StringBuilder(); while(!stack.isEmpty()) { sb.append(stack.pop()).append(" "); } return sb.toString().trim(); } }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。