LeetCode
txHe
这个作者很懒,什么都没留下…
展开
-
[LeetCode]050-Pow(x,n)
题目: Implement pow(x, n). 实现x的n次幂Solution: 类似于二分的方法来优化“x*x*…x“。 要注意的是当n = INT_MIN时,反过来-n会越界,这时候需要pow(x,INT_MIN) * x 即可。代码如下:class Solution {public: double myPow(double x, int n) {原创 2016-05-07 19:23:11 · 661 阅读 · 0 评论 -
[LeetCode]018-4-Sum
题目: 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:Elements in a原创 2015-12-07 22:28:10 · 597 阅读 · 0 评论 -
[LeetCode]020-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 valid原创 2015-12-08 14:38:07 · 269 阅读 · 0 评论 -
[LeetCode]015-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:Elements in a triplet (a,b,c) must b原创 2015-12-07 17:04:07 · 221 阅读 · 0 评论 -
[LeetCode]009-Palindrome Number
题目: Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers. Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of converting the原创 2015-12-06 10:45:12 · 263 阅读 · 0 评论 -
[LeetCode]011-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). Find原创 2015-12-06 19:10:25 · 232 阅读 · 0 评论 -
[LeetCode]008-String to Integer
题目: String to IntegerImplement 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原创 2015-12-06 10:08:25 · 221 阅读 · 0 评论 -
[LeetCode]006-ZigZag Conversion
题目: ZigZag ConversionThe 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)P原创 2015-12-05 20:37:13 · 273 阅读 · 0 评论 -
[LeetCode]004-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)).Solutions(1): //简单的,直接合并原创 2015-12-05 14:41:15 · 283 阅读 · 0 评论 -
[LeetCode]014-Longest Common Prefix
题目: Longest Common PrefixWrite a function to find the longest common prefix string amongst an array of strings. 求所有字符串的公共前缀子串Solution: string longestCommonPrefix(vector<string>& strs) { if(原创 2015-12-06 21:39:21 · 240 阅读 · 0 评论 -
[LeetCode]013-Roman to Integer
题目: Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.Solution(1) 我的答案,读取每个罗马数字,最多4个。 比较长,但好理解。 int romanToInt(string s) { int i原创 2015-12-06 21:01:40 · 269 阅读 · 0 评论 -
[LeetCode]038-Count And Say
题目:The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, …1 is read off as “one 1” or 11. 11 is read off as “two 1s” or 21. 21 is read off as “one 2,原创 2015-12-25 13:56:02 · 378 阅读 · 0 评论 -
[LeetCode]021-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.Subscribe to see which companies asked this questionSol原创 2015-12-08 15:03:46 · 283 阅读 · 0 评论 -
[LeetCode]017-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 “原创 2015-12-07 19:42:11 · 234 阅读 · 0 评论 -
[LeetCode]049-Group Anagrams
题目: Given an array of strings, group anagrams together.For example, given: [“eat”, “tea”, “tan”, “ate”, “nat”, “bat”], Return:[ [“ate”, “eat”,”tea”], [“nat”,”tan”], [“bat”] ]Note:For the re原创 2016-05-07 16:40:26 · 554 阅读 · 0 评论 -
[LeetCode]048-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?Solution: 其实就是矩阵的旋转,找到规律即可,比较简单,代码如下:class Solution {publ原创 2016-05-07 16:06:40 · 425 阅读 · 0 评论 -
[LeetCode]047-Permutations II
题目: Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example, [1,1,2] have the following unique permutations: [1,1,2], [1,2,1], and [2,1,1].原创 2016-05-07 14:54:13 · 1071 阅读 · 0 评论 -
[LeetCode]046-Permutations
题目:Given a collection of distinct numbers, return all possible permutations.For example, [1,2,3] have the following permutations: [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1]. Solutions:原创 2016-05-06 22:35:08 · 1312 阅读 · 0 评论 -
[LeetCode]025-Reverse Nodes in K-Group
题目: Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is原创 2015-12-09 11:35:56 · 328 阅读 · 0 评论 -
[LeetCode]026-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原创 2015-12-09 13:11:04 · 226 阅读 · 0 评论 -
[LeetCode]023-Merge K Sorted Lists
题目: Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Solution(1): 初始做法,虽使用递归,但其实还是两两合并,算法设计的比较差。超时。 复杂度为O(n^2);ListNode* mergeKLists(vector<ListNode原创 2015-12-08 20:04:42 · 321 阅读 · 0 评论 -
[LeetCode]016-3Sum-Closest
题目: 3Sum ClosestGiven 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原创 2015-12-07 18:32:26 · 258 阅读 · 0 评论 -
[LeetCode]019-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 linked li原创 2015-12-08 10:39:35 · 290 阅读 · 0 评论 -
[LeetCode]022-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:“((()))”, “(()())”, “(())()”, “()(())”, “()()()”原创 2015-12-08 16:03:14 · 337 阅读 · 0 评论 -
[LeetCode]012-Integer to Roman
题目: Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.1~9: {“I”, “II”, “III”, “IV”, “V”, “VI”, “VII”, “VIII”, “IX”};10~90: {“X”, “XX”, “XXX”, “X原创 2015-12-06 19:30:11 · 278 阅读 · 0 评论 -
[LeetCode]010-Regular Expression Matching
题目: Regular Expression MatchingImplement regular expression matching with support for ‘.’ and ‘*’.‘.’ Matches any single character. ‘*’ Matches zero or more of the preceding element.The matching shou原创 2015-12-06 14:18:49 · 281 阅读 · 0 评论 -
[LeetCode]043-Multiply Strings
题目: Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative.Solution: 思路: 乘数为num1和num2,则模拟手算,每次更新nu原创 2015-12-30 10:38:43 · 349 阅读 · 0 评论 -
[LeetCode]042-Trapping Rain Water
题目: Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,2,1,0,1,3,2,1,2,1]原创 2015-12-29 19:06:01 · 403 阅读 · 0 评论 -
[LeetCode]041-First Missing Positive Integer
题目: 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 spa原创 2015-12-29 16:44:51 · 609 阅读 · 0 评论 -
[LeetCode]001-TwoSum
Problem: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,原创 2015-11-28 10:13:07 · 330 阅读 · 0 评论 -
[LeetCode]040-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 combinati原创 2015-12-29 14:45:05 · 332 阅读 · 0 评论 -
[LeetCode]039-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 numbe原创 2015-12-29 14:18:12 · 347 阅读 · 0 评论 -
[LeetCode]030-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 onc原创 2015-12-12 12:32:33 · 279 阅读 · 0 评论 -
[LeetCode]028-Implement strStr
题目: Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Solution: 使用了KMP算法,具体介绍在网上有诸多文章介绍,我的博客算法里有篇我的学习指南:int strStr(string haystack,string needl原创 2015-12-11 19:18:00 · 288 阅读 · 0 评论 -
[LeetCode]029-Divide Two Integers
题目: Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT. Solution: 这个解法很多版本,有不少没有考虑越界的情况,本代码测试通过,越界情况值得深思。int divide(int dividend, int diviso原创 2015-12-11 21:51:57 · 323 阅读 · 0 评论 -
[LeetCode]024-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原创 2015-12-08 20:25:53 · 318 阅读 · 0 评论 -
[LeetCode]031-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 possibl原创 2015-12-14 22:47:44 · 255 阅读 · 0 评论 -
[LeetCode]032-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 “()”, whic原创 2015-12-15 13:59:13 · 252 阅读 · 0 评论 -
[LeetCode]033-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 return its原创 2015-12-15 18:56:03 · 237 阅读 · 0 评论 -
[LeetCode]007-Reverse Integer
题目: Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321click to show spoilers. Have you thought about this?Here are some good questions to ask before coding. B原创 2015-12-05 21:44:53 · 280 阅读 · 0 评论