zoukankan      html  css  js  c++  java
  • 824. Goat Latin

    A sentence S is given, composed of words separated by spaces. Each word consists of lowercase and uppercase letters only.

    We would like to convert the sentence to "Goat Latin" (a made-up language similar to Pig Latin.)

    The rules of Goat Latin are as follows:

    • If a word begins with a vowel (a, e, i, o, or u), append "ma" to the end of the word.
      For example, the word 'apple' becomes 'applema'.
       
    • If a word begins with a consonant (i.e. not a vowel), remove the first letter and append it to the end, then add "ma".
      For example, the word "goat" becomes "oatgma".
       
    • Add one letter 'a' to the end of each word per its word index in the sentence, starting with 1.
      For example, the first word gets "a" added to the end, the second word gets "aa" added to the end and so on.

    Return the final sentence representing the conversion from S to Goat Latin. 

    Example 1:

    Input: "I speak Goat Latin"
    Output: "Imaa peaksmaaa oatGmaaaa atinLmaaaaa"
    

    Example 2:

    Input: "The quick brown fox jumped over the lazy dog"
    Output: "heTmaa uickqmaaa rownbmaaaa oxfmaaaaa umpedjmaaaaaa overmaaaaaaa hetmaaaaaaaa azylmaaaaaaaaa ogdmaaaaaaaaaa"
    

    Notes:

    • S contains only uppercase, lowercase and spaces. Exactly one space between each word.
    • 1 <= S.length <= 150.

    time = O(n), space = O(n), n = # of words in input string

    class Solution {
        public String toGoatLatin(String S) {
            if(S == null || S.length() == 0) {
                return S;
            }
            Set<Character> set = new HashSet<>(Arrays.asList('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'));
            
            StringBuilder res = new StringBuilder();
            StringBuilder suffix = new StringBuilder("a");
            
            for(String s : S.split(" ")) {
                if(set.contains(s.charAt(0))) {
                    res.append(s);
                } else {
                    res.append(s.substring(1));
                    res.append(s.charAt(0));
                }
                res.append("ma");
                res.append(suffix).append(" ");
                suffix.append("a");
            }
            res.deleteCharAt(res.length() - 1);
            return res.toString();
        }
    }

    time: O(n + k^2), space: O(k)  n: length of string, k: # words in string

    complexity analysis: https://leetcode.com/problems/goat-latin/discuss/128368/Java-5-ms-solution-with-time-and-space-complexity-explanation

    class Solution {
        public String toGoatLatin(String S) {
            String[] ss = S.split(" ");
            StringBuilder sb = new StringBuilder();
            for(int i = 0; i < ss.length; i++) {
                ss[i] = preprocess(ss[i]);
                ss[i] += "ma";
                ss[i] = postprocess(ss[i], i+1);
                sb.append(ss[i] + " ");
            }
            return sb.deleteCharAt(sb.length() - 1).toString();
        }
        private String preprocess(String s) {
            char[] vowels = {'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'};
            
            for(char c : vowels) {
                if(s.charAt(0) == c)
                    return s;
            }
            String str = s.substring(1);
            str += s.charAt(0);
            return str;
        }
        private String postprocess(String s, int n) {
            for(int i = 0; i < n; i++)
                s += "a";
            return s;
        }
    }
  • 相关阅读:
    递归分治策略
    矩阵连乘问题
    棋盘覆盖问题
    选择排序
    Dijkstra的双栈算术表达式求值算法
    斐波那契数列
    二分算法
    Linux服务器上tengine的安装配置
    Excel Sheet Column Number
    Excel Sheet Column Title
  • 原文地址:https://www.cnblogs.com/fatttcat/p/10134960.html
Copyright © 2011-2022 走看看