leetcode
rosepicker
这个作者很懒,什么都没留下…
展开
-
leetcode TwoSum
-Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, where i原创 2015-07-29 12:29:26 · 324 阅读 · 0 评论 -
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-07-31 12:07:33 · 326 阅读 · 0 评论 -
leetcode 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 linke原创 2015-07-29 15:08:26 · 288 阅读 · 0 评论 -
leetcode ZigZag Conversion
The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) And then read line by line:原创 2015-10-21 15:41:04 · 220 阅读 · 0 评论 -
LeetCode Regular Expression Matching
Implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The matching should cover the entire input原创 2017-01-03 10:34:11 · 147 阅读 · 0 评论 -
LeetCode Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.关于这个题目的描述有歧义,究竟是求解所有字符串的最长公共前序,还是求解每对字符串中的最长的公共子序列。本题的实际是前一种情况。思路一:思路很直接,就像直男癌一样。。。但需要注意边界输入的处理代码如下:原创 2017-01-03 14:01:10 · 191 阅读 · 0 评论 -
LeetCode 3Sum
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note: The solution set must not contain原创 2017-01-05 11:26:46 · 169 阅读 · 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.思路一:穷竭暴力搜索,事件复杂度为O(N^3)思路二:判断一个字符串是否是回文,可以通过首位两个指针分别向中间靠近来判断。但在本题中,无法判断原创 2016-12-28 15:25:10 · 163 阅读 · 0 评论 -
LeetCode 3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exact原创 2017-01-05 14:22:39 · 157 阅读 · 0 评论 -
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 st原创 2017-01-05 15:30:13 · 141 阅读 · 0 评论 -
LeetCode 4Sum
Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.Note: The solution原创 2017-01-05 16:26:43 · 200 阅读 · 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原创 2017-01-06 09:41:30 · 154 阅读 · 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 ca原创 2016-12-29 16:46:00 · 156 阅读 · 0 评论 -
LeetCode-Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.思路一:使用最简单的方法,就是把数字转换为字符串,然后判断字符串是否为回文class Solution {public: bool isPalindrome(int x) { string result="原创 2016-12-29 18:33:25 · 172 阅读 · 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原创 2017-01-06 17:00:52 · 152 阅读 · 0 评论 -
leetcode Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321click to show spoilers.题目看起来很简单,但编写时候发现有些东西需要考虑清楚。 如处理当字符转换后的数是否溢出,以及当输入为-2147483648时,无法将其转换为正整数,因为其对应的正值在sig原创 2015-11-03 22:03:29 · 258 阅读 · 0 评论 -
LeetCode Integer to Roman
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.啥是roman numeral?通过问度娘,发现是古时候罗马用来记录数字的标记法。知道了这个知识点,然后写代码就很easy了。class Solution {pu原创 2016-12-30 11:04:56 · 185 阅读 · 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.罗马数字定义如下:1~9: {"I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"};1原创 2016-12-30 14:47:39 · 168 阅读 · 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原创 2017-01-09 14:48:33 · 132 阅读 · 0 评论 -
LeetCode Minimum Window Substring
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBECODEBANC"T = "ABC"Minimum window is "BANC".原创 2017-01-13 15:26:56 · 170 阅读 · 0 评论 -
LeetCode Search for a Range
Given an array of integers sorted in ascending order, 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原创 2017-01-13 16:33:11 · 282 阅读 · 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. Y原创 2017-01-09 16:52:55 · 159 阅读 · 0 评论 -
LeetCode 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原创 2017-01-10 09:31:58 · 158 阅读 · 0 评论 -
LeetCode Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.这一道题目其实就是k路归并,十分经典的问题。这个可以说是大数据相关或后台面试经常问到的问题。当初面企鹅面到类似的问题没有答上来,技术渣渣啊。。。思路一:分别进行两两归并,直至最原创 2017-01-10 14:30:31 · 200 阅读 · 0 评论 -
LeetCode Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant memory.原创 2017-01-10 15:08:32 · 180 阅读 · 0 评论 -
LeetCode Jump Game II
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your goal is原创 2017-02-06 10:53:51 · 193 阅读 · 0 评论 -
LeetCode Valid Sudoku
Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A partially filled原创 2017-01-14 21:32:11 · 166 阅读 · 0 评论 -
LeetCode Wildcard Matching
Implement wildcard pattern matching with support for '?' and '*'.'?' Matches any single character.'*' Matches any sequence of characters (including the empty sequence).The matching should cover t原创 2017-02-06 16:59:36 · 138 阅读 · 0 评论 -
LeetCode Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[ "((()))", "(()())", "(())()", "()(())原创 2017-01-11 10:45:30 · 220 阅读 · 0 评论 -
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.原创 2017-01-16 08:44:01 · 242 阅读 · 0 评论 -
LeetCode Search in Rotated Sorted Array
Suppose an array sorted in ascending order 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 foun原创 2017-01-16 13:41:52 · 171 阅读 · 0 评论 -
LeetCode Next Permutation
mplement 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 or原创 2017-01-12 10:16:26 · 177 阅读 · 0 评论 -
LeetCode Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine if yo原创 2017-02-08 17:02:55 · 215 阅读 · 0 评论 -
LeetCode Substring with Concatenation of All Words
You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation of each word in words exactly once and原创 2017-01-12 16:03:21 · 160 阅读 · 0 评论 -
LeetCode Maximum Subarray
Total Accepted: 165647Total Submissions: 425680Difficulty: EasyContributors: AdminFind the contiguous subarray within an array (containing at least one number) which has the largest sum.For ex原创 2017-02-09 09:09:11 · 151 阅读 · 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 "()",原创 2017-01-20 14:26:09 · 126 阅读 · 0 评论 -
LeetCode Combination Sum
Given a set of candidate numbers (C) (without duplicates) 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原创 2017-01-24 11:00:24 · 142 阅读 · 0 评论 -
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原创 2017-01-24 13:39:49 · 147 阅读 · 0 评论 -
LeetCode First Missing Positive
Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses constant原创 2017-01-25 09:10:48 · 170 阅读 · 0 评论 -
LeetCode Multiply Strings
Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2.Note:The length of both num1 and num2 is Both num1 and num2 contains only digits原创 2017-01-25 11:27:16 · 470 阅读 · 0 评论