力扣数据结构入门第6天

387字符串中的第一个唯一字符串

def firstUniqChar(self, s):
        """
        :type s: str
        :rtype: int
        """
        if len(s)<=1:
            return 0
        temp=[]
        for i in range(len(s)):
            if s[i] in temp:
                continue
            if i==len(s)-1:
                return i
            for j in range(i+1,len(s)):
                if s[i]==s[j]:
                    temp.append(s[j])
                    break
                if j==len(s)-1:
                    return i
        
        return -1

383赎金信

def canConstruct(self, ransomNote, magazine):
        return not Counter(ransomNote)-Counter(magazine)

242有效字母异位词

def isAnagram(self, s, t):
        if len(s)!=len(t):
            return False
        s1=[]
        [s1.append(_) for _ in s]
        s1.sort()
        s2=[]
        [s2.append(_) for _ in t]
        s2.sort()
        for i in range(len(s1)):
            if s1[i]!=s2[i]:
                return False
        return True