LeetCode周赛#114 Q1 Verifying an Alien Dictionary（字典序）

题目来源：https://leetcode.com/contest/weekly-contest-114/problems/verifying-an-alien-dictionary/

问题描述

 953. Verifying an Alien Dictionary

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).

 

Note:

1. 1 <= words.length <= 100
2. 1 <= words[i].length <= 20
3. order.length == 26
4. All characters in words[i] and order are english lowercase letters.

------------------------------------------------------------

题意

给定一个字符串序列和一个自定义的字母顺序表，问按照该字母表，给定的字符串序列是否是字典序的。

------------------------------------------------------------

思路

按照字典序的定义比较前后两个字符串即可。

------------------------------------------------------------

代码

class Solution {
public:
    bool isAlienSorted(vector<string>& words, string order) {
        int n = words.size(), i, j, len1, len2, len, id1, id2;
        for (i=0; i<n-1; i++)
        {
            len1 = words[i].size();
            len2 = words[i+1].size();
            len = min(len1, len2);
            for (j=0; j<len; j++)
            {
                id1 = order.find(words[i][j]);
                id2 = order.find(words[i+1][j]);
                if (id1 > id2)
                {
                    return false;
                }
                else if (id1 < id2)
                {
                    break;
                }
            }
            if (j ==  len && len1 > len2)
            {
                return false;
            }
        }
        return true;
    }
};