LeetCode151_Reverse Words in a String

标签：leetcode   reverseswords   string   

题目：

Given an input string, reverse the string word by word.

For example,
Given s = "the sky is blue",
return "blue is sky the".

注意的地方：

• 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 static String reverseWords(String s) {
		

		String result="";
		String[] array=s.split(" ");
		for(int i=array.length-1;i>=0;i--)
		{
			if(!array[i].equals(""))
			{
				result+=(result.equals("")?array[i]:" "+array[i]);
			}
		}
		return result;
		
		
        
    }

LeetCode151_Reverse Words in a String

标签：leetcode   reverseswords   string   

原文地址：http://blog.csdn.net/u012249528/article/details/46775645