CherryCheek的博客

class Solution: """ @param pattern: a string, denote pattern string @param str: a string, denote matching string @return: an boolean, denote whether the pattern string and the matching...

class Solution: """ @param: nums: An ineger array @return: An integer """ def removeDuplicates(self, nums): # write your code here i = 0 while i+1 < len(...

class Solution: """ @param: A: A list of integers @param: elem: An integer @return: The new length after remove """ def removeElement(self, A, elem): # write your code ...

class Solution: """ @param: A: sorted integer array A which has m elements, but size of A is m+n @param: m: An integer @param: B: sorted integer array B which has n elements @param...

"""Definition of TreeNode:class TreeNode: def __init__(self, val): self.val = val self.left, self.right = None, None"""class Solution: """ @param root: The root of bin...

class Solution: """ @param: source: source string to be scanned. @param: target: target string containing the sequence of characters to match @return: a index to the first occurrence o...

"""Definition of TreeNode:class TreeNode: def __init__(self, val): self.val = val self.left, self.right = None, None"""class Solution: """ @param root: The root of bin...

"""Definition of ListNodeclass ListNode(object): def __init__(self, val, next=None): self.val = val self.next = next"""class Solution: """ @param l1: the first list ...

class Solution: """ @param: s: a string @return: an integer """ def lengthOfLongestSubstring(self, s): # write your code here res = 0 if s is None or len(s)...

class Solution: def findMedianSortedArrays(self, nums1, nums2): """ :type nums1: List[int] :type nums2: List[int] :rtype: float """ nums = [] ...

class Solution: """ @param s: input string @return: the longest palindromic substring """ def longestPalindrome(self, s): # write your code here res = "" if...

class Solution: def myAtoi(self, str): """ :type str: str :rtype: int """ s = str.strip() syb = 1 ptr = 0 res = 0 if len(s) ...

"""Definition of ListNodeclass ListNode(object): def __init__(self, val, next=None): self.val = val self.next = next"""class Solution: """ @param l1: ListNode l1 is th...

class Solution: """ @param s: A string @return: whether the string is a valid parentheses """ def isValidParentheses(self, s): # write your code here N = len(s) ...

"""Definition of Interval.class Interval(object): def __init__(self, start, end): self.start = start self.end = end"""class Solution: """ @param intervals: interval li...

class Solution: """ @param numbers: An array of Integer @param target: target = numbers[index1] + numbers[index2] @return: [index1 + 1, index2 + 1] (index1 < index2) """ def...

class Solution: """ @param n: the integer to be reversed @return: the reversed integer """ def reverseInteger(self, n): # write your code here -2147483648到2147 483 647 ...

class Solution: """ @param num: a positive number @return: true if it's a palindrome or false """ def isPalindrome(self, num): # write your code here s = str(num) ...

class Solution: """ @param digits: a number represented as an array of digits @return: the result """ def plusOne(self, digits): # write your code here car = 1 ...

class Solution: """ @param a: a number @param b: a number @return: the result """ def addBinary(self, a, b): # write your code here a = list(a) b = list...

class Solution: def fizzBuzz(self, n): """ :type n: int :rtype: List[str] """ res = [] for i in range(1, n+1): if i%3 == 0: ...

class Solution: def myPow(self, x, n): """ :type x: float :type n: int :rtype: float """ return x**n

class Solution: def romanToInt(self, s): """ :type s: str :rtype: int """ s_list = list(s) if len(s_list) == 0: return 0 res = 0...

""" Definition of TreeNode: class TreeNode: def __init__(self, val): self.val = val self.left, self.right = None, None """ class Solution: """ @param root: The r...

class Solution:    def longestCommonPrefix(self, strs):        """        :type strs: List[str]        :rtype: str        """        if len(strs) == 0:            return ''        tmp = strs[0...

class Solution: def convert(self, s, numRows): """ :type s: str :type numRows: int :rtype: str """ N = len(s) res = '' if numRows ==...