qq_45692660的博客

class Solution(object): def merge(self, nums1, m, nums2, n): """ :type nums1: List[int] :type m: int :type nums2: List[int] :type n: int :rtype: None Do not return anything, modify nums1 in-place instea..

class Solution(object): def twoSum(self, numbers, target): """ :type numbers: List[int] :type target: int :rtype: List[int] """ left=0 right=len(numbers)-1 while left<right: .

# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object): def kthToLast(self, head, k): """ :type head: ListNode :type.

1.排序+双指针class Solution(object): def numRescueBoats(self, people, limit): """ :type people: List[int] :type limit: int :rtype: int """ people.sort() f_point=0 l_point=len(people)-1 .

1.哈希表# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object): def hasCycle(self, head): """ :type head: ListNode :rt.

1.哈希表class Solution(object): def findClosest(self, words, word1, word2): """ :type words: List[str] :type word1: str :type word2: str :rtype: int """ l=len(words) hasp_map={} for.

1.哈希表class Solution(object): def intersection(self, nums1, nums2): """ :type nums1: List[int] :type nums2: List[int] :rtype: List[int] """ hasp_map={} for i in range(len(nums1)): if .

1.暴力法：class Solution(object): def sortedSquares(self, nums): """ :type nums: List[int] :rtype: List[int] """ for i in range(len(nums)): nums[i]*=nums[i] nums.sort() return nums2.双指.

class Solution(object): def reverseString(self, s): """ :type s: List[str] :rtype: None Do not return anything, modify s in-place instead. """ ''' all_data=len(s) for i in range.

1.暴力法：时间复杂度：O(N) 空间复杂度：O(N)# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object): def getKthFromEnd(self, head, k): """ :.

1.排序false，true的顺序进行排序class Solution(object): def moveZeroes(self, nums): """ :type nums: List[int] :rtype: None Do not return anything, modify nums in-place instead. """ nums.sort(key=lambda x:x==0)2.先找出不为0的.