z2539329562的博客

第一次做笔试，因为不懂怎么标准输入，然后就没有然后了，写了一个比较烂的程序放在这，不要忘记，以后做笔试看一下'''41 22 33 54 7'''class Solution(): def print_num(self, num_list): print(num_list[0], num_list[1])so = Solution()if __na...

# -*- coding:utf-8 -*-class ListNode: def __init__(self, x): self.val = x self.next = Noneclass Solution: def FindFirstCommonNode(self, pHead1, pHead2): list1_length ...

python2中与用户交互的函数由两个：input 和 raw_input>>> raw_input_A = raw_input("raw_input: ")raw_input: abc >>> input_A = input("Input: ")Input: abcTraceback (most recent call last): File "...

每年六一儿童节,牛客都会准备一些小礼物去看望孤儿院的小朋友,今年亦是如此。HF作为牛客的资深元老,自然也准备了一些小游戏。其中,有个游戏是这样的:首先,让小朋友们围成一个大圈。然后,他随机指定一个数m,让编号为0的小朋友开始报数。每次喊到m-1的那个小朋友要出列唱首歌,然后可以在礼品箱中任意的挑选礼物,并且不再回到圈中,从他的下一个小朋友开始,继续0...m-1报数....这样下去....直到剩下...

class ListNode: def __init__(self, x): self.val = x self.next = Noneclass TreeNode: def __init__(self, x): self.val = x self.left = None self.right = ...

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

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

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

class TreeNode: def __init__(self, elem, left=None, right=None): self.val = elem self.left = left self.right = rightclass SStack: def __init__(self, max_length=10000)...

start = [0, 0]end = [0, 0]axis = [[1, 2], [2, 1], [2, -1], [1, -1], [-1, -2], [-2, -1], [-2, 1], [-1, 2]]step = 5M = 0startx = []starty = []def horse_run(k): global M for each in axi...

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

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

# -*- coding:utf-8 -*-class Solution: def __init__(self): self.begin = 0 self.end = 0 self.valid = True self.max = -10000 def FindGreatestSumOfSubArray(se...

def list_all(string):    new_list_set = []    if len(string) == 1:        return string    for i in range(len(string)):        sub_string = string[:]        sub_string.pop(i)        result_list...

'''kmp algorithm for string在字符串匹配的基础上添加了匹配最大长度子串的功能'''def match_KMP(target, pattern, pnext): t_len, p_len = len(target), len(pattern) i, j = 0, 0 max_pattern = [0]*t_len while i &...

class LNode: def __init__(self, elem, next_=None): self.elem = elem self.next = next_def AddToTail(head, elem): if type(head) is not LNode and head is not None:#如果head的类型不是LN...

class TreeNode: #树节点 def __init__(self, elem, left_child=None, right_child=None): self.elem = elem self.left = left_child self.right = right_childclas...

class Stsck: def __init__(self): self.queue1 = [] self.queue2 = [] def push(self, elem): self.queue1.append(elem) def pop(self): if len(self.queue1) == 0:...

directions = [(1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0), (-1, 1), (0, 1)]class Solution: def __init__(self, row, col): self.flag_arr = [[0 for i in range(col)] for j in range(r...

def partition(data, length, start, end): if data == None or length == 0 or start < 0 or end >= length: return False tmp = end small = start - 1 for index in range(start,...

class SStack(): def __init__(self): self._elem = [] def is_empty(self): return self._elem == [] def top(self): if self.is_empty(): return False ...

class LNode: def __init__(self, elem, _next=None): self.elem = elem self.next_node = _next def reverse_list(phead): if phead == None: return False new_head = None while phead: if phe...

'''path in matrixthe matrix has mt_row * mt_col elementsthe path has len_of_path elements'''class Solution: def __init__(self, arr= None, path=None, row=0, col=0): if arr == None or...

# -*- coding:utf-8 -*-# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass ListNode: def __init__(self, x): self.val = x self.nex...