LeetCode
文章平均质量分 74
每一年秋季新学期的开始,新一轮招聘高峰即将来到。这不禁让人想起找工作的情形,人山人海.......尽可能的搜集各个公司的笔试题,为各个学子进入理想的IT公司做一些铺垫。
@SmartSi
Stay Hungry, Stay Foolish
展开
-
[LeetCode]228.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-08-04 20:51:01 · 1672 阅读 · 0 评论 -
[LeetCode]230.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.Follow up: What if the BST is m原创 2015-08-03 11:34:23 · 1564 阅读 · 0 评论 -
[LeetCode]231.Power of Two
题目Given an integer, write a function to determine if it is a power of two.原创 2015-08-02 09:53:18 · 1349 阅读 · 0 评论 -
[LeetCode]240.Search a 2D Matrix II
题目Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted in ascending from left to right. Integers in each原创 2015-08-01 15:14:39 · 1409 阅读 · 0 评论 -
[LeetCode]232.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-08-01 08:55:14 · 1535 阅读 · 0 评论 -
[LeetCode]238.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(n).For原创 2015-07-31 16:45:28 · 1471 阅读 · 0 评论 -
[LeetCode]239.Sliding Window Maximum
题目Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window原创 2015-07-19 15:49:54 · 2417 阅读 · 0 评论 -
[LeetCode]233.Number of Digit One
题目Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.For example: Given n = 13, Return 6, because digit 1 occurred in the following n原创 2015-07-19 10:53:41 · 2407 阅读 · 0 评论 -
[LeetCode]234.Palindrome Linked List
题目Given a singly linked list, determine if it is a palindrome.Follow up: Could you do it in O(n) time and O(1) space?思路利用双指针法找到链表中点位置,链表中点以后的的元素(不包括中点元素)翻转,再跟链表中点位置以前的元素一一匹配。代码/*----------------------原创 2015-07-18 16:03:22 · 1713 阅读 · 0 评论 -
[LeetCode]235.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 between t原创 2015-07-14 09:02:10 · 1734 阅读 · 0 评论 -
[LeetCode]236.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 nodes v a原创 2015-07-13 16:43:09 · 1754 阅读 · 0 评论 -
[LeetCode]91.Decode Ways
A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determine the total number of ways to原创 2015-06-23 22:54:06 · 2343 阅读 · 0 评论 -
[LeetCode]65.Valid Number
Validate if a given string is numeric.Some examples: “0” => true ” 0.1 ” => true “abc” => false “1 a” => false “2e10” => true Note: It is intended for the problem statement to be ambiguous. You原创 2015-06-16 16:25:21 · 2263 阅读 · 0 评论 -
[LeetCode]93.Restore IP Addresses
题目Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example: Given “25525511135”,return [“255.255.11.135”, “255.255.111.35”]. (Order does no原创 2015-05-15 23:15:01 · 2192 阅读 · 0 评论 -
[LeetCode]*85.Maximal Rectangle
题目Given a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing all ones and return its area.思路对于上图的一个01矩阵。我们可以一行一行的分析,假设第三行,我们按列扫描,遇到0时,柱子断开,重新形成柱子,遇到1时柱子高度加一。这样的话,我们就可以把问题转换原创 2015-05-14 20:48:47 · 1765 阅读 · 0 评论 -
[LeetCode]*84.Largest Rectangle in Histogram
题目Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where width of each ba原创 2015-05-13 17:11:52 · 1999 阅读 · 0 评论 -
[LeetCode]139.Word Break
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, given s = “leetcode”, dict = [“leet”, “原创 2015-05-07 17:17:10 · 2106 阅读 · 0 评论 -
[LeetCode]151.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 O(1) s原创 2015-05-05 22:05:00 · 1868 阅读 · 0 评论 -
[LeetCode]203.Remove Linked List Elements
Remove all elements from a linked list of integers that have value val.Example Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6 Return: 1 –> 2 –> 3 –> 4 –> 5原创 2015-05-02 08:43:43 · 1812 阅读 · 0 评论 -
[LeetCode]*106.Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree.原创 2015-05-01 19:35:03 · 1597 阅读 · 0 评论 -
[LeetCode]*105.Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree.原创 2015-04-28 21:58:20 · 1914 阅读 · 0 评论 -
[LeetCode]201.Bitwise AND of Numbers Range
Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.For example, given the range [5, 7], you should return 4.原创 2015-04-26 15:34:55 · 2037 阅读 · 0 评论 -
[LeetCode]32.Longest Valid Parentheses
题目Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.For “(()”, the longest valid parentheses substring is “()”, which h原创 2015-04-23 20:18:45 · 1829 阅读 · 0 评论 -
[LeetCode]202.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 of原创 2015-04-22 21:26:55 · 2579 阅读 · 0 评论 -
[LeetCode]57.Insert Interval
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start times.Example原创 2015-04-22 15:20:42 · 1606 阅读 · 0 评论 -
[LeetCode]191.Number of 1 Bits
题目Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11’ has binary representation 00000000000原创 2015-04-12 19:55:50 · 1509 阅读 · 0 评论 -
[LeetCode]200.Number of Islands
题目Given a 2d grid map of ‘1’s (land) and ‘0’s (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assum原创 2015-04-10 21:27:46 · 2219 阅读 · 0 评论 -
[LeetCode]198.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 hous原创 2015-04-08 12:16:51 · 2340 阅读 · 1 评论 -
[LeetCode]199.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-04-05 21:00:34 · 2513 阅读 · 0 评论 -
[LeetCode]4.Median of Two Sorted Arrays
Median of Two Sorted Arrays Total Accepted: 4990 Total Submissions: 30805My Submissions There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. Th原创 2015-04-03 11:20:27 · 1573 阅读 · 0 评论 -
[LeetCode]97.Interleaving String
题目Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example, Given: s1 = “aabcc”, s2 = “dbbca”,When s3 = “aadbbcbcac”, return true. When s3 = “aadbbbaccc”, return fal原创 2015-03-25 11:40:58 · 2172 阅读 · 0 评论 -
[LeetCode]164.Maximum Gap
题目Given an unsorted array, find the maximum difference between the successive elements in its sorted form.Try to solve it in linear time/space.Return 0 if the array contains less than 2 elements.You ma原创 2015-03-23 22:44:39 · 2371 阅读 · 0 评论 -
[LeetCode]132.Palindrome Partitioning II
题目Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s.For example, given s = “aab”, Return 1 sinc原创 2015-03-02 23:14:31 · 3446 阅读 · 0 评论 -
[LeetCode]131.Palindrome Partitioning
题目Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s = “aab”, Return[ [“aa”,”b”],原创 2015-03-02 21:07:34 · 1680 阅读 · 0 评论 -
[LeetCode]90.Subsets II
题目Given a collection of integers that might contain duplicates, S, return all possible subsets.Note: Elements in a subset must be in non-descending order. The solution set must not contain duplicate原创 2015-03-01 22:14:15 · 1700 阅读 · 0 评论 -
[LeetCode]72.Edit Distance
题目Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:a)原创 2015-03-01 11:57:01 · 1545 阅读 · 0 评论 -
[LeetCode]55.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 a原创 2015-02-28 22:16:01 · 1590 阅读 · 0 评论 -
[LeetCode]189.Rotate Array
题目Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note: Try to come up as many solutions as you can, th原创 2015-02-25 22:27:55 · 3011 阅读 · 0 评论 -
[LeetCode]76.Minimum Window Substring
题目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 “BANC”.Note原创 2015-02-24 13:23:47 · 3191 阅读 · 0 评论 -
[LeetCode]172.Factorial Trailing Zeroes
Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.原创 2015-02-07 20:42:48 · 1725 阅读 · 0 评论