LeetCode
文章平均质量分 65
LeetCode相关习题
朱传林
每个不曾起舞的日子,都是对生命的辜负!
展开
-
leetCode(55):Minimum Window Substring(limits.h头文件)
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBECODEBANC"T = "ABC"Minimum window is "BAN原创 2015-08-09 22:01:01 · 963 阅读 · 0 评论 -
leetCode(54):Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to原创 2015-08-06 10:09:39 · 605 阅读 · 0 评论 -
leetCode(53):Valid Anagram
Given two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t = "car", return false.Note:You may a原创 2015-08-05 15:25:02 · 548 阅读 · 0 评论 -
leetCode(52):Add Binary
Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".题目并不复杂,以下是我的程序,后面是别人的程序,瞬间low了好大一截!冗长!!!!!!!class Solution {public: s原创 2015-07-28 23:03:32 · 585 阅读 · 0 评论 -
leetCode(51):Valid Palindrome
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" is not a原创 2015-07-25 11:56:07 · 720 阅读 · 0 评论 -
leetCode(50):Summary Ranges
Given a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].本题我采用的是最直观的算法,但整数转化为字符还有些坎坷。应该还有简单的算法,但目前没有时间去研究了。原创 2015-07-24 11:17:01 · 696 阅读 · 0 评论 -
leetCode(49):Count Primes
Description:Count the number of prime numbers less than a non-negative number, n.判断一个数是否是质数主要有以下几种方法:1)直接用该数除于所有小于它的数(非0,1),如果均不能被它整除,则其是质数;2)除以小于它一半的数,因为大于其一半必定是无法整除,如果均不能被它整除,则其是质数;原创 2015-07-24 09:58:04 · 768 阅读 · 0 评论 -
leetCode(48):Excel Sheet Column Number And Excel Sheet Column Title
Given a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ... Z -> 26 AA -> 27 AB -> 28 class Soluti原创 2015-07-24 08:51:41 · 662 阅读 · 0 评论 -
leetCode(47):Triangle
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [原创 2015-07-22 20:03:03 · 650 阅读 · 0 评论 -
leetCode(46):Kth Smallest Element in a BST
Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.Note: You may assume k is always valid, 1 ≤ k ≤ BST's total elements. 直观地一想,查找第k小的数,不就是原创 2015-07-22 14:28:09 · 825 阅读 · 0 评论 -
leetCode(45):Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get原创 2015-07-20 08:34:58 · 709 阅读 · 0 评论 -
leetCode(44):Implement Stack using Queues
Implement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get the top element.empty() -- Return whet原创 2015-07-19 19:29:47 · 467 阅读 · 0 评论 -
leetCode(43):Product of Array Except Self
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O原创 2015-07-19 19:02:36 · 700 阅读 · 0 评论 -
leetCode(42):Flatten Binary Tree to Linked List
Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened tree should look like: 1原创 2015-07-17 18:31:05 · 631 阅读 · 0 评论 -
leetCode(41):Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.取中间的结点作为根结点即平衡二叉树/** * Definition for a binary tree node. * struct TreeNode { * int val; *原创 2015-07-17 17:03:38 · 607 阅读 · 0 评论 -
leetCode(40):Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree and sum原创 2015-07-17 16:46:25 · 864 阅读 · 0 评论 -
leetCode(39):Lowest Common Ancestor of a Binary Tree
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two node原创 2015-07-17 10:03:39 · 712 阅读 · 0 评论 -
leetCode(38):Lowest Common Ancestor of a Binary Search Tree
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined betw原创 2015-07-16 14:48:19 · 850 阅读 · 0 评论 -
leetCode(37):Implement Queue using Stacks
Implement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes the element from in front of queue.peek() -- Get the front element.empty(原创 2015-07-14 08:42:07 · 708 阅读 · 0 评论 -
leetCode(36):Sum Root to Leaf Numbers
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the tota原创 2015-07-13 16:00:36 · 687 阅读 · 0 评论 -
LeetCode(35):Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of converting the integer to string, no原创 2015-07-10 09:26:13 · 660 阅读 · 0 评论 -
leetCode(34):Reverse Words in a String
Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".Update (2015-02-12):For C programmers: Try to solve it in-place in原创 2015-07-08 09:23:09 · 804 阅读 · 0 评论 -
leetCode(33):Rectangle Area
Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.Assume that the tota原创 2015-07-08 08:06:53 · 608 阅读 · 0 评论 -
leetCode(32):Power of Two
Given an integer, write a function to determine if it is a power of two. 2的幂的二进制表示中,必然只有一个“1”,且不可能为负数。class Solution {public: bool isPowerOfTwo(int n) { if(n<0) {//若为负数则原创 2015-07-07 10:40:56 · 753 阅读 · 0 评论 -
leetCode(31):Combination Sum III
Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.Ensure that numbers wi原创 2015-07-07 10:23:21 · 630 阅读 · 0 评论 -
leetCode(30):Sort Colors
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers原创 2015-07-03 07:58:00 · 638 阅读 · 0 评论 -
leetCode(29):Happy Number
Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares原创 2015-07-03 07:55:09 · 586 阅读 · 0 评论 -
leetCode(28):Contains Duplicate II
Given an array of integers and an integer k, find out whether there there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between iand j is at most原创 2015-07-02 09:08:53 · 589 阅读 · 0 评论 -
leetCode(27):Maximal Square
Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.For example, given the following matrix:1 0 1 0 01 0 1 1 11 1 1 1 11 0 0 1 0原创 2015-07-02 09:05:30 · 609 阅读 · 0 评论 -
leetCode(26):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. 1 3 3 2 1 \原创 2015-06-23 14:09:30 · 726 阅读 · 0 评论 -
leetCode(25):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.Th原创 2015-06-23 13:00:19 · 635 阅读 · 0 评论 -
leetCode(24):Binary Search Tree Iterator
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Calling next() will return the next smallest number in the BST.Note: next()原创 2015-06-23 11:50:01 · 802 阅读 · 0 评论 -
leetCode(23):Binary Tree Zigzag Level Order Traversal
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).For example:Given binary原创 2015-06-22 10:08:05 · 669 阅读 · 0 评论 -
leetCode(22):Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For example:Given binary tree {3,9,20,#,#,15,7},原创 2015-06-22 09:09:43 · 563 阅读 · 0 评论 -
leetCode(21):Binary Tree Right Side View
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example:Given the following binary tree, 1原创 2015-06-22 09:00:25 · 624 阅读 · 0 评论 -
leetCode(20):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 the two subtrees of every node never diffe原创 2015-06-22 08:52:17 · 914 阅读 · 0 评论 -
leetCode(19):Count Complete Tree Nodes
Given a complete binary tree, count the number of nodes.Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, except possibly the last, is completely filled,原创 2015-06-22 08:32:26 · 855 阅读 · 0 评论 -
leetCode(18):Construct Binary Tree from Preorder and Inorder (Inorder and Postorder) Traversal
Given preorder and inorder (Inorder and Postorder) traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree. 前序和后序的特点是根结点要么在最前面、要么在最后原创 2015-06-22 08:26:47 · 899 阅读 · 0 评论 -
leetCode(17):Minimum/Maximize depth of binary tree
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node./** * Definition for a binary tre原创 2015-06-21 16:05:06 · 649 阅读 · 0 评论 -
leetCode(16):Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20原创 2015-06-21 15:04:58 · 670 阅读 · 0 评论