joaming的博客

# -*- coding:utf-8 -*-# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: # 返回二维列表，内部每个列表表示找到的路径 def F...

class Solution: def updateMatrix(self, matrix: List[List[int]]) -> List[List[int]]: stack=[] cor=[[1,0],[0,1],[-1,0],[0,-1]] for r in range(len(matrix)): for...

class Solution: def floodFill(self, image: List[List[int]], sr: int, sc: int, newColor: int) -> List[List[int]]: visited=[] pre=image[sr][sc] self.dp(image,sr,sc,newColo...

class Solution: def decodeString(self, s: str) -> str: l=[0] return self.dp(s,l) def dp(self,s,l): res='' n=len(s) while(l[0]<n and s[l[0]]!=...

# -*- coding:utf-8 -*-class Solution: def movingCount(self, threshold, rows, cols): # write code here if rows<1 or cols<1 or threshold<0: return 0 vis...

# -*- coding:utf-8 -*-class Solution: def hasPath(self, matrix, rows, cols, path): # write code here visited=[False for i in range(rows*cols)] if not matrix or rows<1 ...

# -*- coding:utf-8 -*-# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: def isSymmetrical(self, pRoot):...

# -*- coding:utf-8 -*-# class TreeLinkNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = None# self.next = Noneclass Solution: d...

"""# Definition for a Node.class Node: def __init__(self, val, neighbors): self.val = val self.neighbors = neighbors"""class Solution: def cloneGraph(self, node: 'Node') -&...

# -*- coding:utf-8 -*-# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: def HasSubtree(self, pRoot1, pR...

class Solution(object): def isValid(self, s): """ :type s: str :rtype: bool """ left=[u'[',u'{',u'('] right=[u']',u'}',u')'] s=list(s) ...

class Solution: def canVisitAllRooms(self, rooms: List[List[int]]) -> bool: h_room=set() h_room.add(0) visited=[] for k in range(len(rooms[0])): self...

# -*- coding:utf-8 -*-# class RandomListNode:# def __init__(self, x):# self.label = x# self.next = None# self.random = Noneclass Solution: # 返回 RandomListNode ...

-*- coding:utf-8 -*-# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def deleteDuplication(self, pHead): # write code here...

# -*- coding:utf-8 -*-class Solution: def VerifySquenceOfBST(self, sequence): # write code here length = len(sequence) if length == 0: return False if ...

# -*- coding:utf-8 -*-class Solution: def IsPopOrder(self, pushV, popV): # write code here stack=[] index=0 while index<len(popV): if popV[index] no...

class Solution: def __init__(self): self.stack=[] self.minstack=[] def push(self, node): # write code here self.stack.append(node) if not self.minstack ...

# -*- coding:utf-8 -*-class Solution: # matrix类型为二维列表，需要返回列表 def printMatrix(self, matrix): # write code here res=[] while matrix: res+=matrix.pop(0) ...

# -*- coding:utf-8 -*-# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def EntryNodeOfLoop(self, pHead): # write code here...

# -*- coding:utf-8 -*-class Solution: # s字符串 def isNumeric(self, s): # write code here if not s: return False i=0 if s[i] in ['+','-']: ...

# -*- coding:utf-8 -*-class Solution: def Permutation(self, ss): # write code here if not ss: return [] ss=list(ss) l=[] stt='' self.dp...

# -*- coding:utf-8 -*-# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: def Convert(self, pRootOfTree):...

class MyStack: def __init__(self): """ Initialize your data structure here. """ self.l1=[] self.l2=[] def push(self, x: int) -> None: """...

class MyQueue: def __init__(self): """ Initialize your data structure here. """ self.l1=[] self.l2=[] def push(self, x: int) -> None: """...

class Solution(object): def numSquares(self, n): """ :type n: int :rtype: int """ count=0 res=[n] while 0 not in res: count+=1...

class Solution: def missingNumber(self, nums: List[int]) -> int: l=len(nums) for i in range(len(nums)): l+=(i-nums[i]) return l

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

# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def isPalindrome(self, head: ListNode) -> ...

# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def mergeTwoLists(self, l1: ListNode, l2: Lis...

# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def reverseList(self, head: ListNode) -> L...

# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def removeNthFromEnd(self, head: ListNode, n:...

换成数学语言描述一下，一个数轴上分布着分别以3、5、7为间隔距离的三组连续的分隔点，在数轴上随意取一点，求在其右边最近的分隔点离它的距离期望。记该距离为x，很显然x≤3。对于以3为间隔的间隔点组，随意在数轴选一点，由于此为均匀分布，选取点离右边最近间隔点距离小于a的概率为a/3。同理，对于以5为间隔的间隔点组，随意在数轴选一点，选取点离右边最近间隔点距离小于a的概率为a/5；对于以7为间隔的...

给定一个非空整数数组，除了某个元素只出现一次以外，其余每个元素均出现两次。找出那个只出现了一次的元素。说明：你的算法应该具有线性时间复杂度。 你可以不使用额外空间来实现吗？示例 1:输入: [2,2,1]输出: 1示例2:输入: [4,1,2,1,2]输出: 4class Solution: def singleNumber(self, nums: ...

第一种是快排解决办法class Solution { public void sortColors(int[] nums) { quickSort(nums,0,nums.length-1); } public void quickSort(int[] nums,int start,int end){ if (start...

给定一个排序数组，你需要在原地删除重复出现的元素，使得每个元素只出现一次，返回移除后数组的新长度。不要使用额外的数组空间，你必须在原地修改输入数组并在使用 O(1) 额外空间的条件下完成。class Solution { public int removeDuplicates(int[] nums) { int len=nums.length; in...

class Solution { public int search(int[] nums, int target) { int right=nums.length-1; int left=0; int mid=0; while(left<=right){ mid=(right+left)/2;...

# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: def maxDepth(self...

# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: def isSymmetric(s...

# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: def levelOrder(se...

class Solution(object): def generate(self, numRows): """ :type numRows: int :rtype: List[List[int]] """ if not numRows: return [] ln=[[1...