Leetcode python 算法练习

2019.03.28

1、 给定字符串J 代表石头中宝石的类型，和字符串 S代表你拥有的石头。 S 中每个字符代表了一种你拥有的石头的类型，你想知道你拥有的石头中有多少是宝石。
J 中的字母不重复，J 和 S中的所有字符都是字母。字母区分大小写，因此"a"和"A"是不同类型的石头。

class Solution:
    def numJewelsInStones(self, J: str, S: str) -> int:
        count=0;
        for x in S:
            for y in J:
                if x==y:
                    count+=1;
        return count;


class Solution:
    def numJewelsInStones(self, J, S):
        """
        :type J: str
        :type S: str
        :rtype: int
        """
        result = 0
        for i in range(len(S)):
            if S[i] in J:
                result += 1
        return result

2、实现函数 ToLowerCase()，该函数接收一个字符串参数 str，并将该字符串中的大写字母转换成小写字母，之后返回新的字符串。

   newStr = ""
        for i in str:
            if i in string.ascii_uppercase:
                newStr += chr(ord(i) + 32)
            else:
                newStr += i
        return newStr

str.lower()

3、请编写一个函数，使其可以删除某个链表中给定的（非末尾）节点，你将只被给定要求被删除的节点。

    def deleteNode(self, node):
        node.val = node.next.val
        node.next = node.next.next

4、给定一个按非递减顺序排序的整数数组 A，返回每个数字的平方组成的新数组，要求也按非递减顺序排序。

    def sortedSquares(self, A: List[int]) -> List[int]:
        return sorted(x*x for x in A)

5、图像翻转

    def flipAndInvertImage(self, A: List[List[int]]) -> List[List[int]]:
       
        for i in range(len(A)):
            A[i] = A[i][::-1]
            for j in range(len(A[0])):
                A[i][j] = 1-int(A[i][j]           
        return A

6、804. 唯一摩尔斯密码词

    def uniqueMorseRepresentations(self, words: List[str]) -> int:
        moos = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
        quequ = set()
        for i in words:
            temp =''
            for char in i:
                temp += moos[ord(str(char)) - ord("a")]
            quequ.add(temp)
        return len(quequ)
    
    
        def uniqueMorseRepresentations(self, words):
        """
        :type words: List[str]
        :rtype: int
        """
        
        morse = [
            ".-","-...","-.-.","-..",".","..-.","--.","....","..",
            ".---","-.-",".-..","--","-.","---",".--.","--.-",".-.",
            "...","-","..-","...-",".--","-..-","-.--","--.."
        ]
        
        morse_hash = {}
        
        index = 0
        for x in morse:
            morse_hash[chr(97 + index)] = x
            index += 1
        
        s = set()
        
        for x in words:
            ss = ''
            for c in x:
                ss += morse_hash[c]
                
            s.add(ss)
            
        return len(s)    

7、942增减字符串匹配

        left = 0
        right = len(S)
        res = []
        for char in S:
            if char == "I":
                res.append(left)
                left  += 1
            else:
                res.append(right)
                right -= 1
        res.append(right)
        return res