leetcode
文章平均质量分 57
simon-zhao
学习、探索
展开
-
leetcode Longest Substring Without Repeating Characters
题目Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which the length is 3. For原创 2015-05-27 10:36:59 · 1589 阅读 · 0 评论 -
leetcode Pow(x, n)
题目Implement pow(x, n).题目来源:https://leetcode.com/problems/powx-n/分析如何求x的n次幂呢? x的0次幂等于1,x的负数次幂等于正数次幂的倒数。有个注意点,INT_MAX = 2147483647而INT_MIN = -2147483648。所以,x的INT_MIN次幂等于x的(INT_MAX + 1)次幂的倒数。 在求幂的时候一个一个原创 2015-06-03 11:55:37 · 2190 阅读 · 0 评论 -
leetcode 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 complete as many transactions as you like (ie, buy one a原创 2015-05-19 09:43:58 · 1651 阅读 · 0 评论 -
leetcode Best Time to Buy and Sell Stock III
题目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 complete at most two transactions.Note: You may not eng原创 2015-05-19 11:06:51 · 1664 阅读 · 0 评论 -
leetcode Binary Search Tree Iterator
题目原题链接:https://leetcode.com/problems/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() wi原创 2015-05-24 14:57:34 · 1662 阅读 · 0 评论 -
leetcode Implement Trie (Prefix Tree)
题目Implement a trie with insert, search, and startsWith methods.Note: You may assume that all inputs are consist of lowercase letters a-z. 题目来自于:https://leetcode.com/problems/implement-trie-prefix-tre原创 2015-05-26 15:59:40 · 1551 阅读 · 0 评论 -
leetcode Container With Most Water
题目Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two l原创 2015-05-26 19:24:04 · 1615 阅读 · 0 评论 -
leetcode Word Search
题目Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or vertically ne原创 2015-07-07 17:45:32 · 1677 阅读 · 0 评论 -
leetcode Course Schedule
题目There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pai原创 2015-08-04 11:40:57 · 1857 阅读 · 0 评论 -
leetcode Course Schedule II
题目There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pai原创 2015-08-04 15:04:45 · 1652 阅读 · 0 评论 -
【MySQL】【leetcode】 Rising Temperature解题报告
题目Given a Weather table, write a SQL query to find all dates’ Ids with higher temperature compared to its previous (yesterday’s) dates. Id(INT) Date(DATE) Temperature(INT) 1 2015-01-01 10原创 2015-10-20 14:04:44 · 1762 阅读 · 0 评论 -
【MySQL】【leetcode】 Delete Duplicate Emails解题报告
题目Write a SQL query to delete all duplicate email entries in a table named Person, keeping only unique emails based on its smallest Id. Id Email 1 john@example.com 2 bob@example.com 3 jo原创 2015-10-20 15:27:25 · 1649 阅读 · 0 评论 -
【MySQL】【leetcode】 Combine Two Tables解题报告
题目Table: Person+-------------+---------+| Column Name | Type |+-------------+---------+| PersonId | int || FirstName | varchar || LastName | varchar |+-------------+---------+Perso原创 2015-10-20 21:03:45 · 1662 阅读 · 0 评论 -
【MySQL】【leetcode】 Customers Who Never Order解题报告
题目Suppose that a website contains two tables, the Customers table and the Orders table. Write a SQL query to find all customers who never order anything.Table: Customers.+—-+——-+ | Id | Name | +—-+—原创 2015-10-20 15:53:40 · 1766 阅读 · 0 评论 -
【MySQL】【leetcode】 Duplicate Emails解题报告
题目Write a SQL query to find all duplicate emails in a table named Person.+—-+———+ | Id | Email | +—-+———+ | 1 | a@b.com | | 2 | c@d.com | | 3 | a@b.com | +—-+———+ For example, your query sh原创 2015-10-20 16:49:25 · 1751 阅读 · 0 评论 -
【MySQL】【leetcode】 Employees Earning More Than Their Managers解题报告
题目The Employee table holds all employees including their managers. Every employee has an Id, and there is also a column for the manager Id. Id Name Salary ManagerId 1 Joe 70000 3 2 H原创 2015-10-20 17:09:19 · 1629 阅读 · 0 评论 -
【MySQL】【leetcode】 Second Highest Salary解题报告
题目Write a SQL query to get the second highest salary from the Employee table.+—-+——–+ | Id | Salary | +—-+——–+ | 1 | 100 | | 2 | 200 | | 3 | 300 | +—-+——–+ For example, given the abo原创 2015-10-20 20:49:30 · 1892 阅读 · 0 评论 -
leetcode Combination Sum解题报告
题目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 from C unlimited number of原创 2015-10-22 18:20:59 · 1694 阅读 · 0 评论 -
leetcode Implement strStr()
题目Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Update (2014-11-02): The signature of the function had been updated to ret原创 2015-06-02 20:16:39 · 1599 阅读 · 0 评论 -
leetcode Valid Parentheses
题目Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.The brackets must close in the correct order, “()” and “()[]{}” are all valid but原创 2015-06-02 18:40:34 · 1659 阅读 · 0 评论 -
leetcode 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-06-22 21:57:56 · 1641 阅读 · 0 评论 -
leetcode Longest Palindromic Substring
题目Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. 题目来源:https://leetcode.c原创 2015-05-27 11:23:41 · 1643 阅读 · 0 评论 -
leetcode Largest Number
题目Given a list of non negative integers, arrange them such that they form the largest number.For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330.Note: The result may be very larg原创 2015-05-25 15:23:41 · 1803 阅读 · 2 评论 -
leetcode Median of Two Sorted Arrays
题目:There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). 题目来源:https://leetcode.com原创 2015-05-28 11:16:57 · 1726 阅读 · 0 评论 -
leetcode 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-05-29 21:09:39 · 1672 阅读 · 0 评论 -
leetcode:Largest Rectangle in Histogram
Largest Rectangle in Histogram这是leetcode上面的一道题,百度面试的时候也遇到了。原题是这么说的: 思路简单思路:对于数组中的每一个元素height[i],算出包含它的最大的矩形面积。也就是找到它左边第一个小于它高度的下标l(height[l] < height[i]),找到它右边第一个小于它高度的下标r(height[r] < height[i])。包含hei原创 2015-05-14 11:02:53 · 1566 阅读 · 1 评论 -
leetcode Add and Search Word - Data structure design
题目Design a data structure that supports the following two operations:void addWord(word) bool search(word) search(word) can search a literal word or a regular expression string containing only letters原创 2015-05-30 22:38:25 · 1663 阅读 · 1 评论 -
leetcode:Maximal Rectangle
这是leetcode的第85题,原题如下:Given a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing all ones and return its area.leetcode的第84题是Largest Rectangle in Histogram,原题如下: 解决方案在http原创 2015-05-14 12:50:46 · 1681 阅读 · 0 评论 -
Word Ladder II
leetcode: Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that:Only one letter can be changed at a timeEach intermediate wor原创 2014-09-27 10:47:09 · 2150 阅读 · 0 评论 -
排序链表(Sort linked list)
Sort List Sort a linked list in O(n log n) time using constant space complexity使用原创 2014-09-24 14:33:43 · 3018 阅读 · 0 评论 -
leetcode 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 0 1 0 1 1 1 1 1 1 1 1 1 0 0 1 0 Re原创 2015-06-20 21:33:33 · 1629 阅读 · 0 评论 -
leetcode 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-06-21 15:46:11 · 1620 阅读 · 0 评论 -
leetcode 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-06-21 19:35:21 · 1608 阅读 · 0 评论 -
leetcode Word Search II
题目Given a 2D board and a list of words from the dictionary, find all words in the board.Each word must be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizo原创 2015-06-01 09:12:13 · 1711 阅读 · 0 评论 -
leetcode Best Time to Buy and Sell Stock
题目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 complete at most one transaction (ie, buy one and sell one share of the stock), de原创 2015-05-18 22:12:44 · 1582 阅读 · 0 评论 -
leetcode House Robber II
题目Note: This is an extension of House Robber.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, a原创 2015-06-21 21:12:14 · 1663 阅读 · 0 评论 -
leetcode 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-06-21 20:03:32 · 1721 阅读 · 0 评论 -
leetcode String to Integer (atoi)
题目Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases原创 2015-06-02 18:13:17 · 1597 阅读 · 0 评论 -
leetcode 338. Counting Bits
分析打算用动态规划,所以先找x和x-1的规律: 0 1 10 11 100 101 110 111 1000 1001 1010 1010010100101 1010010100110 111 1000f(x) 表示x二进制表示中1的个数, m表示从右往左第一个0的位置(从0开始计数)。找数字x-1 从右往左第一个0的位置m;f(x) = f(x-1) - m + 1原创 2016-04-14 19:07:30 · 1565 阅读 · 0 评论