Leetcode刷题（十一）

一、2085. 统计出现过一次的公共字符串

代码： 

class Solution:
    def countWords(self, words1: List[str], words2: List[str]) -> int:
        cnt1 = Counter(words1)
        cnt2 = Counter(words2)
        return sum(v == 1 and cnt2[w] == 1 for w, v in cnt1.items())

二、2089. 找出数组排序后的目标下标

 

 代码：

class Solution:
    def targetIndices(self, nums: List[int], target: int) -> List[int]:
        ans = []
        nums.sort()
        for i, x in enumerate(nums):
            if x == target:
                ans.append(i)
        return ans

三、2108. 找出数组中的第一个回文字符串

 

 代码：

class Solution:
    def firstPalindrome(self, words: List[str]) -> str:
        def Palindrome(s:str) -> bool:
            if s[::-1] == s:
                return True
            else:
                return False
        for word in words:
            if Palindrome(word):
                return word
        return ""

四、2154. 将找到的值乘以 2

代码： 

class Solution:
    def findFinalValue(self, nums: List[int], original: int) -> int:
        flag = True
        while flag:
            if original in nums:
                original = original*2
            else:
                flag = False
        return original