首页 > 代码库 > [leetcode]Reverse Words in a String
[leetcode]Reverse Words in a String
Reverse Words in a String
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.
算法思路：
栈。（当然也可以逆序，就不需要借助栈了）
代码如下：
1 public class Solution { 2 public String reverseWords(String s) { 3 if(s == null || s.trim().length() == 0) return ""; 4 Stack<String> stack = new Stack<String>(); 5 s = s.trim(); 6 int start = 0,i = 0; 7 for(; i < s.length(); i++){ 8 if(s.charAt(i) == ‘ ‘){ 9 String word = s.substring(start, i);10 stack.add(word);11 while(s.charAt(i) == ‘ ‘) i++;12 start = i;13 }14 }15 stack.add(s.substring(start, i));16 StringBuilder sb = new StringBuilder();17 while(!stack.isEmpty()){18 sb.append(stack.pop());19 sb.append(‘ ‘);20 }21 return sb.toString().trim();22 }23 }
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。