leetcode JAVA Reverse Words in a String 难度系数2-3?最新题151

昨天睡觉之前,同学提醒说leetcode出了道新题,早上爬起来做了一下,本来用了string的split,写完发现二了,没有办法切割多个空格的情况,如果想切割多个空格,那就一定要带上正则表达式了。于是老老实实的从尾遍历到头。

好吧,上代码:

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 "";
        s = s.trim();
        if(s=="")
        	return "";
        StringBuffer sb = new StringBuffer();
        int i = s.length()-1;
        int last = i;
        while(i>=0){
        	while(i>=0&&s.charAt(i)!=' '){
        		i--;
        	}
        	String temp = s.substring(i+1,last+1);
        	sb.append(temp);
        	sb.append(" ");
        	while(i>=0&&s.charAt(i)==' '){
        		i--;
        	}
        	last = i;
        }
        while(sb.length()>1&&sb.charAt(sb.length()-1)==' ')
        	sb.deleteCharAt(sb.length()-1);
        return sb.toString();
    }
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 3
    评论
评论 3
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值