首页 > 其他 > 详细

[leetcode] Reverse Words in a String

时间:2014-07-08 22:41:14      阅读:346      评论:0      收藏:0      [点我收藏+]

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

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

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.

https://oj.leetcode.com/problems/reverse-words-in-a-string/

 

思路:用split方法分割后倒序遍历加入结果中即可。

 

/**
 * http://blog.csdn.net/perfect8886/article/details/20833685
 * 
 * */
public class Solution {
    public String reverseWords(String s) {
        String[] a = s.split(" ");
        StringBuilder sb = new StringBuilder();
        for (int i = a.length - 1; i >= 0; i--) {
            if (!a[i].equals("")) {
                sb.append(a[i]);
                sb.append(" ");
            }
        }
        if (sb.length() > 1)
            sb.deleteCharAt(sb.length() - 1);

        return sb.toString();
    }

    public static void main(String[] args) {
        System.out.println(new Solution().reverseWords("the sky is blue"));
    }

}

 

[leetcode] Reverse Words in a String,布布扣,bubuko.com

[leetcode] Reverse Words in a String

原文:http://www.cnblogs.com/jdflyfly/p/3830538.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!