leetcode
文章平均质量分 62
努力小菜籽
这个作者很懒,什么都没留下…
展开
-
334. Increasing Triplet Subsequence
题目:Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.Formally the function should:Return true if there exists i, j, k such that ar原创 2016-02-16 14:25:26 · 510 阅读 · 0 评论 -
[leetcode]221. 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原创 2016-07-21 12:53:24 · 786 阅读 · 0 评论 -
[leetcode]62. Unique Paths
题目:A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to r原创 2016-07-09 08:46:59 · 305 阅读 · 0 评论 -
[leetcode]35. Search Insert Position
题目: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 order.You may assume no duplicates in t原创 2016-06-22 21:10:26 · 239 阅读 · 0 评论 -
[leetcode]34. Search for a Range
题目:Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is not fou原创 2016-06-20 20:13:25 · 275 阅读 · 0 评论 -
[leetcode]33. Search in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the array retur原创 2016-06-19 09:01:06 · 217 阅读 · 0 评论 -
[leetcode]29. Divide Two Integers
题目:Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.分析:用移位操作,把除数左移直到刚好比被除数小(就是再移就比被除数大了),从被除数中把这一部分拿掉,继续这样的操作,那么每次移的位数也就是结果中的一部分。原创 2016-06-18 09:15:03 · 267 阅读 · 0 评论 -
[leetcode]120. 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原创 2016-07-14 21:17:52 · 353 阅读 · 0 评论 -
[leetcode]19. Remove Nth Node From End of List
分析:这次写的代码虽然过了但是是根据测试用例出错了慢慢改的,代码也不是很漂亮。。具体差别就是如果刚好要删掉的是头指针的值,就会比较麻烦。两种代码如下,第一个更好一些。代码:/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * L原创 2016-07-03 09:14:46 · 333 阅读 · 0 评论 -
[leetcode]95. Unique Binary Search Trees II
题目:Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique BST's shown bel原创 2016-07-13 22:37:27 · 367 阅读 · 0 评论 -
[leetcode]11. 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). Fin原创 2016-07-02 08:58:09 · 316 阅读 · 0 评论 -
[leetcoed]3. Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "原创 2016-07-01 22:50:19 · 292 阅读 · 0 评论 -
[leetcode]96. 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原创 2016-07-12 22:34:15 · 324 阅读 · 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原创 2016-07-11 22:45:40 · 785 阅读 · 0 评论 -
[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)).分析:方法来自http://blog.c转载 2016-06-14 09:50:36 · 260 阅读 · 0 评论 -
[leetcode]63. Unique Paths II
题目:Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively原创 2016-07-10 09:26:05 · 271 阅读 · 0 评论 -
Palindrome Linked List/链表的回文结构
题目:判断单链表是否为回文结构(比如1,2,3,2,1)分析:做这个题目首先要问清楚空间复杂度要求。①若不规定空间复杂度,那么可以定义一个vector,把链表的元素一一装入,再通过vector的索引从两边往中间判断是否回文;代码如下:/** * Definition for singly-linked list. * struct ListNode { * int val原创 2016-04-05 19:14:23 · 332 阅读 · 0 评论 -
207. Course Schedule
class Solution {public: bool canFinish(int numCourses, vector>& prerequisites) { map count; for(int i=0;i<numCourses;i++){ count[i]=0; } for(int i=0;i原创 2016-02-23 21:43:48 · 390 阅读 · 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, givens = "leetcode",dict = ["leet"原创 2016-09-09 16:22:24 · 370 阅读 · 0 评论