LeetCode
文章平均质量分 64
QihaoD
留个言吧,会很开心的,哈哈
展开
-
[LeetCode] Find Peak Element
A peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.You may imagine that num[-1] = num[n] = -原创 2014-12-06 02:36:45 · 496 阅读 · 0 评论 -
[leetCode] Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new length.p原创 2015-05-15 01:03:23 · 397 阅读 · 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 num原创 2015-05-20 23:32:20 · 368 阅读 · 0 评论 -
[leetCode] Combination Sum II
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the combina原创 2015-05-20 23:52:57 · 331 阅读 · 0 评论 -
[leetCode] 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.public class Solution { public int maximalRectangle(char[][] matrix) {原创 2015-05-17 01:31:06 · 402 阅读 · 0 评论 -
[leetCode] Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element原创 2015-06-18 22:27:10 · 295 阅读 · 0 评论 -
[leetCode] 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-06-18 22:25:20 · 299 阅读 · 0 评论 -
[leetCode] 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-06-18 22:28:29 · 310 阅读 · 0 评论 -
[leetCode] 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"].public class Solution { private List res;原创 2015-07-03 09:52:27 · 375 阅读 · 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 01 0 1 1 11 1 1 1 11 0 0 1 0原创 2015-07-04 02:03:04 · 365 阅读 · 0 评论 -
[leetCode] Power of Two
Given an integer, write a function to determine if it is a power of two.public class Solution { public boolean isPowerOfTwo(int n) { if (n <= 0) return false; int nn = n;原创 2015-07-06 23:22:59 · 418 阅读 · 0 评论 -
[leetCode] Different Ways to Add Parentheses
Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *.Example 1原创 2015-08-04 02:15:01 · 595 阅读 · 0 评论 -
[leetCode] 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?public class Solution { ListNode h; public boolean isPalindrome(ListNo原创 2015-08-19 00:56:40 · 338 阅读 · 0 评论 -
[leetCode] 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 y原创 2015-05-15 00:52:07 · 361 阅读 · 0 评论 -
[leetCode] Merge Sorted Array
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold addit原创 2015-05-15 08:02:13 · 375 阅读 · 0 评论 -
[LeetCode] 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原创 2014-12-06 12:31:08 · 336 阅读 · 0 评论 -
[LeetCode] Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element原创 2014-12-23 01:38:04 · 347 阅读 · 0 评论 -
[leetCode] Intersection of Two Linked Lists
Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists: A: a1 → a2 ↘原创 2014-12-09 01:48:40 · 316 阅读 · 0 评论 -
[leetCode] Find Minimum in Rotated Sorted Array I & II
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).Find the minimum element.You may assume no duplicate exists in原创 2014-12-28 06:47:50 · 301 阅读 · 0 评论 -
[LeetCode] Excel Sheet Column Title
Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example: 1 -> A 2 -> B 3 -> C ... 26 -> Z 27 -> AA 28 -> AB Credits原创 2014-12-28 01:26:19 · 501 阅读 · 0 评论 -
[leetCode] Compare Version Numbers
Compare two version numbers version1 and version1.If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0.You may assume that the version strings are non-empty and co原创 2014-12-28 02:02:00 · 292 阅读 · 0 评论 -
[leetCode] Maximum Product Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the largest原创 2014-12-28 07:55:42 · 390 阅读 · 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原创 2014-12-28 05:43:30 · 452 阅读 · 0 评论 -
[leetCode] Search a 2D Matrix
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 from left to right.The first integer of each原创 2015-05-11 22:42:37 · 372 阅读 · 0 评论 -
[leetCode] Rotate Image
You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?public class Solution { public void rotate(int[原创 2015-05-11 23:36:08 · 311 阅读 · 0 评论 -
[leetCode] 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 found原创 2015-05-11 22:30:04 · 312 阅读 · 0 评论 -
[leetCode] Word Search (new start. Let's go this)
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原创 2015-05-05 05:02:58 · 336 阅读 · 0 评论 -
[leetCode] Minimum Size Subarray Sum
Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 0 instead.For example, given the array [2,3原创 2015-05-15 07:41:48 · 328 阅读 · 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 house原创 2015-08-22 00:31:10 · 310 阅读 · 0 评论