qdqade的博客_leetcode

101. Symmetric Tree

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ &nbs

example

following

whether

原创 2016-04-08 14:33:40 649 阅读

98. Validate Binary Search Tree

Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node's key.

search

return

determine

false

原创 2016-04-07 13:13:43 631 阅读

299. Bulls and Cows

You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide

C/C++

leetcode

原创 2016-04-06 13:53:48 682 阅读

338. Counting Bits

Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array.Ex

function

possibly

complexity

原创 2016-03-23 16:04:54 603 阅读

94. Binary Tree Inorder Traversal——递归，栈

Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ &nbs

C/C++

中序遍历

原创 2016-03-18 16:10:03 856 阅读

144. Binary Tree Preorder Traversal——递归，非递归

Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ &nb

先序遍历

原创 2016-03-18 15:39:53 465 阅读

78. Subsets

Given a set of distinct integers, nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.For example,If&nb

solution

possible

contain

原创 2016-03-17 16:31:15 580 阅读

117. Populating Next Right Pointers in Each Node II

Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution still work?Note:You may only use constant extra space.

solution

function

following

原创 2016-03-17 13:24:56 787 阅读

116. Populating Next Right Pointers in Each Node

Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; &n

perfect

children

following

原创 2016-03-17 11:33:51 514 阅读

220. Contains Duplicate III

Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at most

Duplicate

Contains

原创 2016-03-15 17:11:55 1012 阅读

219. Contains Duplicate II

Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference betw

Duplicate

Contains

原创 2016-03-15 16:12:38 360 阅读

Single Number

Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using

number

Single

原创 2016-03-15 12:03:11 483 阅读

337. House Robber III

The thief has found himself a new place for his thievery again. There is only one entrance to this area,&

without

contact

tonight

原创 2016-03-14 16:42:47 637 阅读

213. House Robber II

After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all houses at this place are arranged in

determine

attention

arranged

原创 2016-03-14 15:22:32 571 阅读

House Robber

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent house

原创 2016-03-14 14:00:27 364 阅读

动态规划之 minimum path sum

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can on

C/C++

动态规划

原创 2016-02-19 18:41:58 571 阅读

二叉搜索树与双向链表

输入一棵二叉搜索树，将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点，只能调整树中结点指针的指向。二叉搜索树的中序遍历即是有序的，中序遍历同时转变即可，转换左子树，左子树最右边，为左子树有序的最后一个节点为lastnode，root->left=lastnode如果lastnode非空，lastnode->right=root;右树非空，转换之。最后，原根节点指向的是序

二叉搜索树与双向链表

原创 2015-09-25 10:51:10 363 阅读

栈的压入、弹出序列

题目描述输入两个整数序列，第一个序列表示栈的压入顺序，请判断第二个序列是否为该栈的弹出顺序。假设压入栈的所有数字均不相等。例如序列1,2,3,4,5是某栈的压入顺序，序列4，5,3,2,1是该压栈序列对应的一个弹出序列，但4,3,5,1,2就不可能是该压栈序列的弹出序列。解法：模拟栈的操作创建一个stack变量，表示入栈；如果stack为空，或者stack.top()==popV[i],stack

栈的压入、弹出序列

原创 2015-09-22 13:05:30 457 阅读

Gray Code

The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequen

system

sequence

number

return

example

原创 2015-09-17 15:18:32 480 阅读

sqrt(x)

Implement int sqrt(int x).Compute and return the square root of x. int mySqrt(int x) { if(x<=1) return x; &

sqrt

原创 2015-09-15 17:38:50 482 阅读

Pow(x, n)

Implement pow(x, n).递归解法double powercore(double base,int ex){ if(ex==0) return 1; &nbs

Pow(x

n)

原创 2015-09-15 17:21:27 556 阅读

leetcode Group Anagrams

Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return:[ ["ate", "eat","tea"], ["nat","tan"],

字符串

return

example

原创 2015-09-15 16:38:39 435 阅读

Jump Game II

Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your goal is to rea

number

example

element

represents

minimum

原创 2015-09-15 14:56:14 416 阅读

Jump Game

Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine if you ar

jump game

原创 2015-09-15 12:05:22 528 阅读

Wildcard Matching

Implement wildcard pattern matching with support for '?' and '*'.'?' Matches any single character. '*' Matches any sequence of characters&nb

character

function

examples

including

matching

转载精选 2015-09-15 11:49:44 571 阅读

Multiply Strings

Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative. string multiply(string num1, string num

Multiply Strings

原创 2015-09-15 10:22:24 366 阅读

Trapping Rain Water

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,2,1,

where

example

Rain

原创 2015-09-15 09:37:49 373 阅读

First Missing Positive

Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n)

元素

example

positive

原创 2015-09-14 14:37:49 287 阅读

Combination Sum II

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used&

collection

solution

positive

including

contain

原创 2015-09-14 10:36:06 396 阅读

Combination Sum I

Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen fr

solution

positive

including

contain

repeated

原创 2015-09-14 10:27:06 335 阅读

官方博客	全部文章	热门标签	班级博客
了解我们	网站地图	意见反馈

鸿蒙开发者社区	51CTO学堂
51CTO	软考资讯

51CTO博客

searching

101. Symmetric Tree

98. Validate Binary Search Tree

299. Bulls and Cows

338. Counting Bits

94. Binary Tree Inorder Traversal——递归，栈

144. Binary Tree Preorder Traversal——递归，非递归

78. Subsets

117. Populating Next Right Pointers in Each Node II

116. Populating Next Right Pointers in Each Node

220. Contains Duplicate III

219. Contains Duplicate II

Single Number

337. House Robber III

213. House Robber II

House Robber

动态规划之 minimum path sum

二叉搜索树与双向链表

栈的压入、弹出序列

Gray Code

sqrt(x)

Pow(x, n)

leetcode Group Anagrams

Jump Game II

Jump Game

Wildcard Matching

Multiply Strings

Trapping Rain Water

First Missing Positive

Combination Sum II

Combination Sum I

欢迎