leetcode 383. Ransom Note

Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constructed from the magazines ; otherwise, it will return false.

Each letter in the magazine string can only be used once in your ransom note.

Note:
You may assume that both strings contain only lowercase letters.

canConstruct("a", "b") -> false
canConstruct("aa", "ab") -> false
canConstruct("aa", "aab") -> true

class Solution(object):
    def canConstruct(self, ransomNote, magazine):
        """
        :type ransomNote: str
        :type magazine: str
        :rtype: bool
        """
        if len(ransomNote)==1 and magazine.find(ransomNote)==-1:
            return False
        ran=list(ransomNote)
        ran.sort()
        count=1
        temp=''
        for i in range(0,len(ran)-1):
            if ran[i]==ran[i+1]:
                count+=1
                temp=ran[i+1]
            else:
                if magazine.count(ran[i])<count:
                    return False
                count=1
                temp=ran[i+1]
        if magazine.count(temp)<count:
            return False
        return True