953.Verifying-an-Alien-Dictionary

953. Verifying an Alien Dictionary

题目地址

https://leetcode.com/problems/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).

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

代码

Approach #1 Check Adjacent Words

class Solution {
  public boolean isAlienSorted(String[] words, String order) {
    // 1. 生成字典序
        int[] index = new int[26];
    for (int i = 0; i < order.length(); i++) {
      index[order.charAt(i) - 'a'] = i;
    }

    // 2. 两两比较
    search: for (int i = 0; i < words.length - 1; i++) {
      String word1 = words[i];
      String word2 = words[i + 1];

      for (int k = 0; k < Math.min(word1.length(), word2.length()); k++) {
        if (word1.charAt(k) != word2.charAt(k)) {
          if (index[word1.charAt(K) - 'a'] > index[word2.charAt(k) - 'a']) {
            return false;
          }
          continue search;
        }
      }

      if (word1.length() > word2.length()) {
        return false;
      }
    }

    return true;
  }
}