Leetcode
文章平均质量分 71
「已注销」
这个作者很懒,什么都没留下…
展开
-
leetcode_question_67 Add Binary
Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".bool isAllZero(string a){ for (int i = 0; i < a.length(); ++i) {原创 2013-09-14 12:29:49 · 1432 阅读 · 0 评论 -
leetcode_question_70 Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?int climbStairs(int n) {原创 2013-09-14 12:47:05 · 1280 阅读 · 0 评论 -
leetcode_question_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 in the原创 2013-09-14 16:37:20 · 1652 阅读 · 0 评论 -
leetcode_question_53 Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [−2,1,−3,4,−1,2,1,−5,4],the contiguous subarray [4,−1,2,1] ha原创 2013-09-15 16:41:21 · 1451 阅读 · 0 评论 -
leetcode_question_26 Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with原创 2013-09-15 01:24:46 · 1252 阅读 · 0 评论 -
Leetcode: Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Have you thought about this?Here are some good questions to ask before coding.原创 2013-09-30 11:46:51 · 10484 阅读 · 3 评论 -
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原创 2013-09-30 22:27:46 · 2021 阅读 · 0 评论 -
Leetcode: Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists./** * Definition for singly-linked list. * struct原创 2013-09-30 23:46:13 · 2058 阅读 · 0 评论 -
leetcode_question_27 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.i原创 2013-09-15 01:36:18 · 1237 阅读 · 0 评论 -
leetcode_question_64 Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or righ原创 2013-09-14 16:07:10 · 1277 阅读 · 0 评论 -
leetcode_question_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 w原创 2013-09-14 23:28:31 · 2187 阅读 · 0 评论 -
Leetcode: Integer to Roman
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.罗马数字是由字符I,V,X,L,C,D,M等等表示的,其中I = 1;V = 5;X = 10;L = 50;C = 100;D = 500;M =原创 2013-10-01 11:59:21 · 2672 阅读 · 0 评论 -
Leetcode: Spiral Matrix
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]原创 2013-09-30 23:23:06 · 2212 阅读 · 0 评论 -
Leetcode: Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the原创 2013-10-01 18:10:13 · 1683 阅读 · 0 评论 -
Leetcode: Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.利用上一题的程序:Judge Small: Accepted!Judge Large:Time Limit Exceededmap romanmp;原创 2013-10-01 16:21:36 · 4690 阅读 · 1 评论 -
Leetcode: Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit string原创 2013-10-01 17:42:34 · 2103 阅读 · 0 评论 -
leetcode_question_5 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.stupid method:原创 2013-09-15 18:03:31 · 1265 阅读 · 0 评论 -
leetcode_question_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,4], [原创 2013-09-16 10:03:36 · 2352 阅读 · 1 评论 -
leetcode_question_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",原创 2013-09-15 22:08:06 · 6881 阅读 · 0 评论 -
leetcode_question_115 Distinct Subsequences
Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which is formed from the original string by deleting some (can be n原创 2013-09-16 22:55:01 · 1636 阅读 · 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 vali原创 2013-10-01 18:25:34 · 4392 阅读 · 0 评论 -
Leetcode: Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. You m原创 2013-10-02 22:08:14 · 1776 阅读 · 0 评论 -
Leetcode: Single Number
Given an array of integers, every element appears twice except for one. Find that single one.Could you implement it without using extra memory?int singleNumber(int A[], int n) { // Not原创 2013-10-02 22:45:34 · 4652 阅读 · 1 评论 -
Leetcode: Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity./** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode原创 2013-10-02 22:40:22 · 3602 阅读 · 0 评论 -
Leetcode: Spiral Matrix II
Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9, 4 ], [原创 2013-10-02 23:51:30 · 2861 阅读 · 0 评论 -
leetcode_question_31 Next Permutation
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest possible原创 2013-09-18 12:08:07 · 3808 阅读 · 0 评论 -
leetcode_question_2 Add Two Numbers
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link原创 2013-09-17 23:25:05 · 1194 阅读 · 0 评论 -
Leetcode: Single Number II
Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without usi原创 2013-10-03 20:36:44 · 5878 阅读 · 7 评论 -
Leetcode: 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 the array.原创 2013-10-03 20:44:38 · 1063 阅读 · 0 评论 -
Leetcode: Gray Code
The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequence of原创 2013-10-03 11:21:31 · 6561 阅读 · 2 评论 -
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 "()", wh原创 2013-10-03 12:05:13 · 3419 阅读 · 0 评论 -
leetcode_question_85 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原创 2013-09-18 14:00:28 · 11769 阅读 · 8 评论 -
Leetcode: 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 duplica原创 2013-10-03 22:05:48 · 4771 阅读 · 0 评论 -
Leetcode: Combinations
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]原创 2013-10-04 13:20:20 · 4170 阅读 · 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 o原创 2013-10-04 16:42:06 · 5653 阅读 · 1 评论 -
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原创 2013-10-04 16:43:41 · 2509 阅读 · 0 评论 -
Leetcode: Remove Duplicates from Sorted Array II
Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array A = [1,1,1,2,2,3],Your function should return length = 5, and A is now [1,1,2,2,原创 2013-10-04 19:22:02 · 1140 阅读 · 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?void rotate(vector > &matrix) { // No原创 2013-10-04 20:07:51 · 1769 阅读 · 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原创 2013-10-04 22:27:26 · 1531 阅读 · 0 评论 -
Leetcode: Search in Rotated Sorted Array II
Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function to determine if a given target is in the arr原创 2013-10-04 22:15:27 · 3165 阅读 · 1 评论