【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.

Java:

重点就是用了spilt("\\s+")操作,然后考虑下边界情况:null," ",""

public class Solution {
   public String reverseWords(String s) {  
      if(s==null) return null;
      s=s.trim();
      if(s.length()==0) return "";
      
      String[] temp=s.split("\\s+");
      StringBuilder sb= new StringBuilder();
      int i=temp.length-1;
      while(i>=0)
      {
          sb.append(temp[i]);
          if(i!=0) sb.append(" ");
          i--;
      }
      return sb.toString();
    }  
}




Reference:

http://blog.csdn.net/linhuanmars/article/details/20982463

第一种没看懂, 第二种:

public class Solution {
   public String reverseWords(String s) {  
      if(s==null) return null;
      s=s.trim();
      if(s.length()==0) return "";
      StringBuilder res= new StringBuilder();
      for(int i=s.length()-1;i>=0;i--)
      {
          if(s.charAt(i)!=s.length()&&s.charAt(i)==' '&&s.charAt(i)==s.charAt(i+1)) continue;
          res.append(s.charAt(i));
      }
      int left=0;
      int right=0;
      while(right<res.length())
      {
          while(right<res.length()&&res.charAt(right)!=' ')
          {
              right++;
          }
          int next=right+1;
          right--;
          while(left<right)
          {
              char temp=res.charAt(left);
              res.setCharAt(left++, res.charAt(right));
              res.setCharAt(right--,temp);
              
          }
          left=next;
          right=next;
          
      }
      return res.toString();
    }  
}
第一种递归:

public String reverseWords(String s) {
    s = s.trim();
    return helper(s,0).toString();
}
private StringBuilder helper(String s, int index)
{
    if(index>=s.length())
        return new StringBuilder(); 
    StringBuilder cur = new StringBuilder();
    int lastIndex = index;
    while(index < s.length() && s.charAt(index)!=' ')
    {
        cur.append(s.charAt(index++));
    }
    while(index < s.length() && s.charAt(index)==' ')
        index++;
    if(lastIndex == 0)
        return helper(s,index).append(cur);
    return helper(s,index).append(cur).append(' ');
}



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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值