[Leetcode] 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.

public class Solution {
    public String reverseWords(String s) {
        if(s == null)
            return null;
        if(s.length() == 0)
            return s;
        char[] array = s.toCharArray();
        reverse(array, 0, array.length - 1);
        int index = -1;
        int start = 0;
        int space = -1;
        while(start < array.length && array[start] == ' ')
            start++;
        while(start < array.length){
            if(index == -1 || array[start] != ' ')
                array[++index] = array[start++];
            else if(array[start] == ' ' && array[index] == ' '){
                start++;
            }
            else {// array[start] == ' ' && array[index] != ' ' 
                reverse(array, space + 1, index);
                array[++index] = array[start++];
                space = index;
            }
        }
        reverse(array, space + 1, index);
        if(index == -1)
            return new String("");
        else{
            if(index < array.length && array[index] == ' ')
                return new String(array, 0, index);
            else
                return new String(array, 0, index + 1);
        }
    }
    public void reverse(char[] array, int left, int right){
        while(left < right){
            char temp = array[left];
            array[left] = array[right];
            array[right] = temp;
            left++;
            right--;
        }
    }
}

Use Java String.split()
public class Solution {
    public String reverseWords(String s) {
        if(s == null)
            return null;
        if(s.length() == 0)
            return s;
        String[] res = s.split(" ");
        StringBuilder sb = new StringBuilder("");
        for(int i = res.length - 1; i >= 0; i--)
            if(res[i].length() != 0){
                sb.append(' ');
                sb.append(res[i]);
            }
        if(sb.length() == 0)
            return sb.toString();
        return sb.substring(1, sb.length());
    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值