ledecode Reverse Words in a String III

557. Reverse Words in a String III

Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.

Example 1:

Input: "Let's take LeetCode contest"
Output: "s'teL ekat edoCteeL tsetnoc"

 

 

Note: In the string, each word is separated by single space and there will not be any extra space in the string.

 

package leedcode;

class Solution {

    public static void main(String[] args) {
//        String s = "Let's take LeetCode contest";
        String s = "12345";
        System.out.println(s);
        System.out.println(new Solution().reverseWords(s));
    }

    public static void reverseWord(char[] chars, int begin, int end) {

        for (int i = begin; i <= end; i++) {
            char temp = chars[i];
            chars[i] = chars[end];
            chars[end] = temp;
            end--;
        }

    }


    public String reverseWords(String s) {

        char[] chars = s.toCharArray();
        int start = 0;
        int end = 0;

        for (int i = 0; i < chars.length; i++) {

            if (chars[i] == ' ') {
                end = i;
                reverseWord(chars, start, end-1);
                start = end+1;
            }
            end++;
        }

        reverseWord(chars,start,end-1);

        return new String(chars);
    }
}

 

重新整理逻辑

class Solution {
   
    
      public static void reverseWord(char[] chars, int begin, int end) {

        for (int i = begin; i <= end; i++) {
            char temp = chars[i];
            chars[i] = chars[end];
            chars[end] = temp;
            end--;
        }

    }


    public String reverseWords(String s) {

        char[] chars = s.toCharArray();
        int start = 0;
        int end = 0;

        for (int i = 0; i < chars.length; i++) {
            if (chars[i] == ' ') {
                end = i;
                reverseWord(chars, start, end-1);
                start = end+1;
            } 
            end++;
        }
        
        reverseWord(chars,start,end-1);
        
        return new String(chars);
    }
}

 

转载于:https://www.cnblogs.com/chengpeng15/p/10029860.html

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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值