
LeetCode
文章平均质量分 93
lllcfr1
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
LeetCode (F)
First Missing Positive AC Rate: 546/2441 My Submissions Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] return 3, and [3,4,-1,1]原创 2013-10-03 00:15:04 · 574 阅读 · 0 评论 -
Leetcode (H)
House Robber Total Accepted: 3183 Total Submissions: 11595My Submissions Question Solution You are a professional robber planning to rob houses along a street. Each house has原创 2015-04-03 14:44:02 · 699 阅读 · 0 评论 -
LeetCode (L)
Largest Rectangle in Histogram Total Accepted: 14600 Total Submissions: 69120 My Submissions Given n non-negative integers representing the histogram's bar height where the width of eac原创 2014-08-30 12:08:09 · 534 阅读 · 0 评论 -
LeetCode (M)
Maximum Depth of Binary Tree Total Accepted: 14814 Total Submissions: 34098My Submissions Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the原创 2014-04-15 15:54:46 · 684 阅读 · 0 评论 -
LeetCode (P)
Pow(x, n) Total Accepted: 5493 Total Submissions: 21464My Submissions Implement pow(x, n). class Solution { double power(double x, long long n) { if (n < 0) return 1 /原创 2014-01-12 12:16:58 · 740 阅读 · 0 评论 -
LeetCode (T)
Two Sum Total Accepted: 7313 Total Submissions: 33518My Submissions Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum sh原创 2013-12-24 16:44:19 · 622 阅读 · 0 评论 -
LeetCode (J)
Jump Game Total Accepted: 3798 Total Submissions: 14230My Submissions Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element原创 2013-12-23 19:52:58 · 635 阅读 · 0 评论 -
LeetCode (V)
Valid Palindrome Total Accepted: 4292 Total Submissions: 20224My Submissions Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.原创 2014-01-02 19:14:09 · 697 阅读 · 0 评论 -
LeetCode (I)
Integer to Roman Total Accepted: 2872 Total Submissions: 9293My Submissions Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.原创 2013-12-30 16:48:01 · 597 阅读 · 0 评论 -
LeetCode (E)
Edit Distance AC Rate: 199/772 My Submissions Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 st原创 2013-09-24 10:54:55 · 746 阅读 · 0 评论 -
LeetCode (A)
LeetCode (interview questions online judge) http://www.leetcode.com/onlinejudge id: lcfr all questions with codes will be updated here in this thread of blog. another programmer job discussion原创 2012-10-12 01:28:04 · 882 阅读 · 0 评论 -
LeetCode (U)
Unique Binary Search Trees Total Accepted: 3880 Total Submissions: 11207My Submissions Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For exam原创 2013-12-09 11:34:02 · 675 阅读 · 0 评论 -
LeetCode (G)
Gas Station Total Accepted: 3278 Total Submissions: 14438My Submissions There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car wi原创 2013-11-16 15:19:27 · 678 阅读 · 0 评论 -
LeetCode (B)
Balanced Binary TreeOct 9 '12 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 t原创 2013-09-12 20:48:12 · 594 阅读 · 0 评论 -
LeetCode (Z)
ZigZag Conversion AC Rate: 200/827 My Submissions The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this patter原创 2013-09-24 10:32:52 · 606 阅读 · 0 评论 -
LeetCode (D)
Decode Ways AC Rate: 471/2906 My Submissions A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given a原创 2013-10-03 11:23:54 · 547 阅读 · 0 评论 -
LeetCode (N)
Next Permutation AC Rate: 761/2986 My Submissions Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangem原创 2013-10-13 23:18:52 · 729 阅读 · 0 评论