953. Verifying an Alien Dictionary，很少把lambda写的那么复杂

In an alien language, surprisingly they also use english lowercase letters, but possibly in a different order. The order of the alphabet is some permutation of lowercase letters.

Given a sequence of words written in the alien language, and the order of the alphabet, return true if and only if the given words are sorted lexicographicaly in this alien language.

 

Example 1:

Input: words = ["hello","leetcode"], order = "hlabcdefgijkmnopqrstuvwxyz"
Output: true
Explanation: As 'h' comes before 'l' in this language, then the sequence is sorted.

Example 2:

Input: words = ["word","world","row"], order = "worldabcefghijkmnpqstuvxyz"
Output: false
Explanation: As 'd' comes after 'l' in this language, then words[0] > words[1], hence the sequence is unsorted.

Example 3:

Input: words = ["apple","app"], order = "abcdefghijklmnopqrstuvwxyz"
Output: false
Explanation: The first three characters "app" match, and the second string is shorter (in size.) According to lexicographical rules "apple" > "app", because 'l' > '∅', where '∅' is defined as the blank character which is less than any other character (More info).

 

Constraints:

• 1 <= words.length <= 100
• 1 <= words[i].length <= 20
• order.length == 26
• All characters in words[i] and order are English lowercase letters.

直接附上答案吧。

class Solution {
public:
    bool isAlienSorted(vector<string>& words, string order) {
        std::map<char, int> helper;
        for(int i = 0; i < order.size(); i++)
            helper[order[i]] = i;
        vector<string> temp(words.begin(), words.end());
        std::sort(temp.begin(), temp.end(), [&helper](string s1, string s2){
            for(int i = 0; i < s1.size() and i < s2.size(); i++)
            {
                if(s1[i] == s2[i])
                    continue;
                if(helper[s1[i]] < helper[s2[i]])
                    return true;
                else
                    return false;
            }
            if(s1.size() == s2.size())
                return true;
            if(s1.size() < s2.size())
                return true;
            else
                return false;

        });
        return words == temp;
    }
};

运行效果

Runtime: 32 ms, faster than 7.47% of C++ online submissions for Verifying an Alien Dictionary.

Memory Usage: 12.7 MB, less than 7.69% of C++ online submissions forVerifying an Alien Dictionary.

看到有人是两个两个比较，应该快一些，因为一旦发现不满足排序就退出，不用做全排序。