Print Words Vertically

Given a string s. Return all the words vertically in the same order in which they appear in s.
Words are returned as a list of strings, complete with spaces when is necessary. (Trailing spaces are not allowed).
Each word would be put on only one column and that in one column there will be only one word.

LeetCode Problem - 1324

import java.util.*;

class Solution {
    // This method prints the vertical representation of a given string.
    public List<String> printVertically(String s) {
        // Initialize a list to store the vertical representation.
        List<String> ans = new ArrayList<>();

        // Split the input string into an array of words.
        String[] sArray = s.split(" ");

        // Convert the array to a list to facilitate finding the maximum length string.
        List<String> sArrayList = Arrays.asList(sArray);

        // Find the maximum length string in the list.
        String maxLengthString = Collections.max(sArrayList, Comparator.comparing(String::length));
        int maxLengthStringLen = maxLengthString.length();

        // Iterate through each character position vertically.
        for (int i = 0; i < maxLengthStringLen; i++) {
            StringBuilder sb = new StringBuilder();

            // Iterate through each word in the array.
            for (int j = 0; j < sArray.length; j++) {
                // If the current word has characters left, append the character to the StringBuilder.
                if (i < sArray[j].length()) {
                    char c = sArray[j].charAt(i);
                    sb.append(c);
                }
                // If the current word is shorter, append a space.
                else {
                    sb.append(" ");
                }
            }

            // Remove trailing spaces and add the result to the output list.
            String stringAns = sb.toString().replaceAll("\\s+$", "");
            ans.add(stringAns);
        }

        return ans;
    }
}