S.Mming

python爬猫眼top10

# -*- coding:utf-8 -*- class Solution: # array 二维列表 def Find(self, target, array): # write code here n = len(array) flag = 'false' for i in range(n): ...

# -*- coding:utf-8 -*- # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: # 返回构造的TreeNode根节点 def reCon...

# -*- coding:utf-8 -*- class Solution: def jumpFloor(self, number): # write code here a = 1 b = 1 for i in range(number): t = a+b a = b ...

# -*- coding:utf-8 -*- class Solution: def NumberOf1(self, n): # write code here flag=1 print(type(flag)) count=0 maxBit=32 for i in range(maxBit): ...

# -*- coding:utf-8 -*- # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: # 返回ListNode def ReverseList(self, pHead): if no...

# -*- coding:utf-8 -*- # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: # 返回合并后列表 def Merge(self, pHead1, pHead2): # wri...

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