题解 | 牛群消息传递

牛群消息传递

https://www.nowcoder.com/practice/28df6c40150a40b49c9c4d4ae1dd675d

import java.util.*;


public class Solution {
    public String reverseWords (String s) {
        // 1. split
        final char[] chars = s.toCharArray();
        final int n = chars.length;
        final Deque<String> words = new ArrayDeque<>();
        int i = 0;
        while (i < n) {
            if (chars[i] == ' ') {
                ++i;
                continue;
            }
            final int start = i;
            while (i < n && chars[i] != ' ') {
                ++i;
            }
            words.addLast(s.substring(start, i));
        }
        // 2. reverse
        final StringBuilder sb = new StringBuilder();
        sb.append(words.removeLast());
        while (!words.isEmpty()) {
            sb.append(' ');
            sb.append(words.removeLast());
        }
        return sb.toString();
    }
}

全部评论

相关推荐

评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务