标签:
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.
public class Solution { public String reverseWords(String s) { s=s.trim(); s=s.replaceAll("[\\s]+"," "); String str[]=s.split(" "); Stack<String> sta=new Stack<String>(); String ans=""; for(String c:str){ sta.push(c); } while(!sta.isEmpty()){ ans=ans+sta.pop()+" "; } return ans.trim(); } }
public class StringAPIDemo08{ public static void main(String args[]){ String str1 = "hello world" ; // 定义字符串,3个空格 //str1=str1.replaceAll("[\\s]+", " "); String s[] = str1.split(" ") ; // 按空格进行字符串的拆分 System.out.println(s.length) ; //s的长度为4,空格包含在了字符串里面。 for(int i=0;i<s.length;i++){ // 循环输出 System.out.println(s[i]) ; } } };
LeetCode 151:Reverse Words in a String
标签:
原文地址:http://www.cnblogs.com/gonewithgt/p/4559999.html