Minor simplification to is_pangram in the Bit field approach

This commit is contained in:
Hanson Char
2023-04-06 07:47:02 -07:00
committed by BethanyG
parent 84c35bac97
commit 9bbd540c5c
2 changed files with 4 additions and 4 deletions

View File

@@ -9,9 +9,9 @@ ALL_26_BITS_SET = 67108863
def is_pangram(sentence): def is_pangram(sentence):
letter_flags = 0 letter_flags = 0
for letter in sentence: for letter in sentence:
if letter >= 'a' and letter <= 'z': if 'a' <= letter <= 'z':
letter_flags |= 1 << ord(letter) - A_LCASE letter_flags |= 1 << ord(letter) - A_LCASE
elif letter >= 'A' and letter <= 'Z': elif 'A' <= letter <= 'Z':
letter_flags |= 1 << ord(letter) - A_UCASE letter_flags |= 1 << ord(letter) - A_UCASE
return letter_flags == ALL_26_BITS_SET return letter_flags == ALL_26_BITS_SET

View File

@@ -43,9 +43,9 @@ ALL_26_BITS_SET = 67108863;
def is_pangram(sentence): def is_pangram(sentence):
letter_flags = 0 letter_flags = 0
for letter in sentence: for letter in sentence:
if letter >= 'a' and letter <= 'z': if 'a' <= letter <= 'z':
letter_flags |= 1 << (ord(letter) - A_LCASE) letter_flags |= 1 << (ord(letter) - A_LCASE)
elif letter >= 'A' and letter <= 'Z': elif 'A' <= letter <= 'Z':
letter_flags |= 1 << (ord(letter) - A_UCASE) letter_flags |= 1 << (ord(letter) - A_UCASE)
return letter_flags == ALL_26_BITS_SET return letter_flags == ALL_26_BITS_SET