Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
Expand Up @@ -34,13 +34,12 @@ def sherlockAndAnagrams(s_word: str) -> int:
total: int = 0
q_candidates = 0
# Final Anagram list
for word in list(candidates):
quantity_of_anagrams = len(candidates[word])

for word, candidates_of in candidates.items():
quantity_of_anagrams = len(candidates_of)
k = 2

if quantity_of_anagrams <= 1:
del candidates[word]
else:
if quantity_of_anagrams > 1:
# Binomial coefficient: https://en.wikipedia.org/wiki/Binomial_coefficient
q_candidates += quantity_of_anagrams

Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -79,7 +79,7 @@ def buildTree(indexes: List[List[int]]) -> Node:
__INITIAL_LEVEL__,
callbackCollectNodes)

last_level: int = sorted(list(node_collector))[-1]
last_level: int = sorted(node_collector)[-1]

for i in range(0, min(len(indexes_copy), len(node_collector[last_level]))):
current_node: Node = node_collector[last_level][i]
Expand Down
2 changes: 1 addition & 1 deletion src/projecteuler/helpers/word_score.py
Original file line number Diff line number Diff line change
Expand Up @@ -31,7 +31,7 @@
def wordScore(word: str) -> int:
result = 0

for letter in list(word):
for letter in word:
if letter in _scoreLetter:
result += _scoreLetter[letter]

Expand Down
Loading