Roger King的打怪练级房

题目： Search Insert Position Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointe

题目： Single Number II   Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or

题目： Single Number II   Given an array of integers, every element appears three times except for one. Find that single one. Note: Your algorithm should have a linear runt

题目： Climbing Stairs You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

题目： Merge Two Sorted Lists Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 来源：http://oj.leetco

题目： Remove Duplicates from Sorted Array II Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to co

题目： Pascal's Triangle Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Return [ [1], [1,1], [1,2,1], [1,3,

题目： Balanced Binary Tree   Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary

题目： Remove Duplicates from Sorted Array Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may assume that A has enough space

题目： Pascal's Triangle Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may assume that A has enough space (size that is greater or

题目： Merge Two Sorted Lists Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Return [ [1], [1,1],

题目： Remove Duplicates from Sorted Array II Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For example, Given sorted array A = [

题目： Balanced Binary Tree   Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of

题目： Linked List Cycle Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next point

题目： Binary Tree Postorder Traversal   Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 \ 2

题目： Maximum Subarray   Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2,1,−5,4],

题目： Maximum Depth of Binary Tree  Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

题目： Reverse Integer  Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 来源：http://oj.leetcode.com/problems/reverse-integer/ 思路： 截位，一位一位的来；

题目： 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

题目： Unique Binary Search Trees  Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For example, Given n = 3, there are a total of 5 unique BST's.

题目： Best Time to Buy and Sell Stock II   Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may c

题目： Linked List Cycle   Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? 来源：http://oj.leetcode.com/problems/linked-list-

题目： Same Tree Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same valu

题目： Integer to Roman   Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.

题目： 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 \ 2

题目： Remove Element   Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 来源：http://oj.leetcode.com/

题目： 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 \ 2 / 3 re

题目： Convert Sorted Array to Binary Search Tree   Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 来源：http