leetcode 3019. Number of Changing Keys

https://leetcode.com/problems/number-of-changing-keys/description/

LeetCode - The World's Leading Online Programming Learning Platform

 

class Solution:
    def countKeyChanges(self, s: str) -> int:
        answer = 0
        for i in range(1, len(s)):
            if s[i - 1].lower() != s[i].lower():
                answer += 1
        
        return answer
        

아스키코드로 비교할수도 있긴한데.. 

소문자로 만들어서 인접한 두 문자를 비교하는 방식이 더 쉬워 보이네요