善积跬步

class Solution: """ @param {int} n an integer. @return {int} the nth prime number as description. """ def nthUglyNumber(self, n): # write your code here L = [0

def atoi(self, str): # write your code here str = str.strip() if (str == '' or str[0] == '.' or '-' in str[1:] or str.count('.') > 1 o...

Ldef longestCommonPrefix(self, strs): # write your code here if '' in strs or strs == []: return '' s, n = '', '' for j in range(min([len(i) for i in strs])): for i in ...

def longestCommonSubstring(self, A, B): # write your code here if A == '' or B == '': return 0 if len(A) >= len(B): L, L1 = A[:], B[:] el...

def anagrams(self, strs): # write your code here L = [i if len(i) <= 1 else sorted(i) for i in strs] return [strs[i] for i in range(len(L)) if L.count(L[i]) > 1]

def compareStrings(A, B): # write your code here if len(A) < len(B): return False if len(A) == len(B): return(sorted(A) == sorted(B)) for i in B: if A.count(...

class Solution: #@param A and B: sorted integer array A and B. #@return: A new sorted integer array def mergeSortedArray(self, A, B): # write your code here return sorted(A

class Solution: # @param k & A a integer and an array # @return ans a integer def kthLargestElement(self, k, A): A = sorted(A, reverse=True) return A[k-1]

class Solution: # @param k & n two integer # @return ans a integer def digitCounts(self, k, n): L = ''.join([str(i) for i in range(n+1)]) c = L.count(str(k)) retur

class Solution: # @param n a integer # @return as a integer def trailingZeros(self, n): if n == 0: return 1 x = 0 while n > 5: x += n //

def removeDuplicates(self, nums): # write your code here if nums == []: return 0 index,count = 0, 1 for i in range(1, len(nums)): if nums[index] == nums[i] and count &l...