数据结构
独鹿
啊哈
展开
-
letcode153Find Minimum in Rotated Sorted Array
class Solution(object): def findMin(self, nums): """ :type nums: List[int] :rtype: int """ l,r=0,len(nums)-1 while l mid=l+(r-l)原创 2017-05-11 12:41:19 · 189 阅读 · 0 评论 -
[leetcode 560]Subarray Sum Equals K
题目:求连续子集和为k的个数代码出自:https://discuss.leetcode.com/topic/88041/super-simple-pythonclass Solution(object): def subarraySum(self, nums, k): """ :type nums: List[int] :type k: int ...原创 2017-05-18 15:13:18 · 516 阅读 · 0 评论 -
[leetcode 561]Array Partition I
题目:求2n个数字的数组组成n对中的每个小数字之和最大nums.sort() return sum(nums[::2])原创 2017-05-18 15:31:36 · 219 阅读 · 0 评论 -
[leetcode108]Convert Sorted Array to Binary Search Tree
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(objec原创 2017-05-09 21:14:45 · 186 阅读 · 0 评论 -
[leetcode 53]Maximum Subarray
class Solution(object): def maxSubArray(self, nums): """ :type nums: List[int] :rtype: int """ if not nums: return None d=[0]*le原创 2017-05-09 21:46:32 · 182 阅读 · 0 评论 -
35. Search Insert Position
class Solution(object): def searchInsert(self, nums, target): """ :type nums: List[int] :type target: int :rtype: int """ n=len(nums)原创 2017-05-19 10:10:16 · 193 阅读 · 0 评论 -
34. Search for a Range
class Solution(object): def searchRange(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ l,r=0,len(nums原创 2017-05-19 11:34:23 · 222 阅读 · 0 评论 -
python定义树
用python自定义树,先定义节点,然后在把节点合成树。class TreeNode(object): def __init__(self,root,left=None,right=None): self.root = root self.left = left self.right = rightA = TreeNode('A')B =...原创 2018-03-30 20:11:08 · 3025 阅读 · 0 评论 -
二叉树中和为给定值的所有路径
本质上是压栈出栈的过程1.写一个主题函数主题函数中要给定默认的树,给定的值,还要一个用来存路径的列表,再加一个记录路径长度的变量2.写一个找路径的函数首先要确定给的节点是不是一个空的,如果是空的则直接退出;其次,把当前节点加入到路径,把当前节点值加进路径长度然后,判断当前是不是叶子(叶子用一个变量表示)如果是叶子,则再判断叶子路径和和给定值是不是一样,一样则打印路径,不一样则不管如果不是叶子,则分...原创 2018-03-30 22:42:07 · 320 阅读 · 0 评论 -
翻转单词顺序
思路:先翻转所有字符,再根据空格来翻转每个单词。解:1.写一个翻转函数 2.注意python 中字符串无法修改,要转为list,最后结果再转为str 3.遇到空格后要翻转单词,但注意翻转的下标,一不小心会把空格也翻转了。 4.左旋字符串也是一样的,只是分割不再用空格,而是根据数组下标来分割def reverse(data): if data is Non...原创 2018-04-12 17:44:42 · 207 阅读 · 0 评论 -
[leetcode 33]Search in Rotated Sorted Array
class Solution(object): def search(self, nums, target): """ :type nums: List[int] :type target: int :rtype: int """ n=len(nums) l,r=原创 2017-05-09 11:08:26 · 167 阅读 · 0 评论 -
leetcode31Next Permutation
class Solution(object): def nextPermutation(self, nums): """ :type nums: List[int] :rtype: void Do not return anything, modify nums in-place instead. """原创 2017-05-09 10:38:16 · 156 阅读 · 0 评论 -
[Leetcode 25] Reverse Nodes in k Group
# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object): def reverseKGroup(se原创 2017-05-08 19:53:06 · 218 阅读 · 0 评论 -
DFS学习
1.对于一个图,任意选一个节点作为起始节点2.选择一个选择规则3.走到有标记过的或者无法走的时候原路返回再走特点:递归过程,二叉树的序列遍历原创 2017-04-25 17:21:47 · 234 阅读 · 0 评论 -
快排实现
继续mark原创 2016-08-30 20:43:11 · 494 阅读 · 0 评论 -
海量数据之top排序
数据库一种原创 2016-08-30 20:41:28 · 376 阅读 · 0 评论 -
求数列和
import java.util.Scanner;/**求数列的和(编程题须知)(参考答案)Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem Description:数列的定义如下:数列的第一项为n,以后各项为前一项的平方根,求数列的前m项的和。输入输入数原创 2016-08-15 15:50:56 · 844 阅读 · 0 评论 -
106Construct Binary Tree from Inorder and Postorder Traversal
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object):原创 2017-05-24 12:30:57 · 192 阅读 · 0 评论 -
118. Pascal's Triangle
class Solution(object): def generate(self, numRows): """ :type numRows: int :rtype: List[List[int]] """ res=[] if numRows==0: re原创 2017-05-24 15:04:28 · 215 阅读 · 0 评论 -
119. Pascal's Triangle II
class Solution(object): def getRow(self, rowIndex): """ :type rowIndex: int :rtype: List[int] """ pre=[1,1] if rowIndex==0: retu原创 2017-05-24 15:22:41 · 171 阅读 · 0 评论 -
leetcode83Remove Duplicates from Sorted List
# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object): def deleteDuplicates原创 2017-05-05 20:33:55 · 209 阅读 · 0 评论 -
leetcode148 sort list
# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object): def sortList(self, h原创 2017-05-08 15:34:16 · 171 阅读 · 0 评论 -
数组中查找给定值
def findk(m,k): if m is None: return False r = 0 c = len(m[0])-1 while r<len(m[0]) and c>=0 andc<len(m): print r,c if m[r][c]==k: return True elif m[r][c]>k: c ...原创 2018-05-01 21:31:52 · 327 阅读 · 0 评论