class Solution:
def firstUniqChar(self, s: str) -> int:
for i in range(len(s)):
for j in range(len(s)):
if i!=j and s[j] == s[i]:
break
else:
return i
return -1
class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
ransomNote = list(ransomNote)
magazine = list(magazine)
for i in range(len(ransomNote)):
for j in range(len(magazine)):
if ransomNote[i] == magazine[j]:
magazine[j] = '0'
ransomNote[i] = '0'
for i in range(len(ransomNote)):
if ransomNote[i] != '0':
return False
return True
暴力解法,直接遍历,如果当前元素有,则把目标元素也置为0,最后判断是否全为0即可。
from collections import Counter
class Solution:
def isAnagram(self, s: str, t: str) -> bool:
a = Counter(s)
b = Counter(t)
if a == b:
return True
else:
return False