2023.02.02 Today's Challenge

https://leetcode.com/problems/verifying-an-alien-dictionary/

Verifying an Alien Dictionary - LeetCode

단순히 한글자 비교로는 이슈가 생김.
Map으로 구현하면 됨

class Solution:
    def isAlienSorted(self, words: List[str], order: str) -> bool:
        map = {}
        for i in range(len(order)):
            map[order[i]] = i
        for i in range(1, len(words)):
            first = words[i-1]
            second = words[i]
            n = min(len(first), len(second))
            flag = False
            for j in range(n):
                if map[first[j]] < map[second[j]]:
                    flag = True
                    break
                elif map[first[j]] > map[second[j]]:
                    return False
            if not flag and len(first) > len(second):
                return False
        return True