乱乱写

class Solution:     # @param {integer[]} nums     # @return {integer}     def removeDuplicates(self, nums):         if not nums:             return 0         sz=0         for i in range(len(num

class Solution: # @param {integer[]} nums # @param {integer} target # @return {integer} def threeSumClosest(self, nums, target): "only one solution indicates that there is no w

class Solution:     # @param {integer[]} nums     # @param {integer} target     # @return {integer[]}     def twoSum(self,nums, target):         "for array, if we would check whether some element

class Solution:     # @param {integer[]} nums     # @return {integer}     def longestConsecutive(self, nums):         """         "if there is no limit on the time complexity, we can sort the arr

class Solution:     # @param {integer[]} nums     # @return {integer[][]}     def threeSum(self, nums):         "O(n**2), for k-sum, time complexity is O(max{nlogn,n**(k-1)})"         nums.sort()

class Solution:     # @param {integer[]} nums1     # @param {integer[]} nums2     # @return {float}     def findMedianSortedArrays(self, num1, num2):         """         "time complexity O(m+n)"

class Solution:     # @param {integer[]} nums     # @param {integer} target     # @return {boolean}     def search(self, nums, target):         "considering the situation: nums[low]=nums[mid]=num

class Solution:     # @param {integer[]} nums     # @param {integer} target     # @return {integer}     def search(self, nums, target):         """         Complixity is O(n)         try:     

class Solution:     # @param {integer[]} nums     # @return {integer}     def removeDuplicates(self, nums):         "remove duplicates from sorted array without generating extra memory, O(n)"

class Solution: # @param {integer[]} nums # @param {integer} target # @return {integer[][]} def fourSum(self, nums, target): "if we adopt left-><-right method, the time complex