Java clean solution with O(n) space no split()


  • 0
    A
    public class Solution {
        public String reverseWords(String s) {
            StringBuilder sb = new StringBuilder();
            for (int i=s.length()-1; i>=0; ) {
                while (i>=0 && s.charAt(i)==' ') i--;
                int end=i;
                while (i>=0 && s.charAt(i)!=' ') i--;
                int start=i;
                sb.append(s.substring(start+1, end+1)).append(" ");
            }
            return sb.toString().trim();
        }
    }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.