书生营第四期L0G2000 Python 基础知识

闯关任务 Leetcode 383(笔记中提交代码与leetcode提交通过截图)

class Solution:def canConstruct(self, ransomNote: str, magazine: str) -> bool:note = [0]*26maga = [0]*26for s in ransomNote:note[ord(s)-ord('a')] += 1for s in magazine:maga[ord(s)-ord('a')] += 1for i in range(26):if note[i] > maga[i]:return Falsereturn True

闯关任务 Vscode连接InternStudio debug笔记