LeetCode专栏
Duke700
这个作者很懒,什么都没留下…
展开
-
LeetCode之1_Two Sum
LeetCode之Two Sum解题分析,nlogn 的两端迫近查找方法。原创 2014-11-07 10:49:24 · 523 阅读 · 0 评论 -
LeetCode之16_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 h原创 2016-06-26 13:59:35 · 412 阅读 · 0 评论 -
LeetCode之17_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.原创 2016-06-26 14:08:04 · 355 阅读 · 0 评论 -
LeetCode之18_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: T原创 2016-06-26 14:15:26 · 405 阅读 · 0 评论 -
LeetCode之15_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原创 2016-06-26 13:53:47 · 300 阅读 · 0 评论 -
LeetCode之10_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 enti原创 2016-06-16 22:03:25 · 492 阅读 · 0 评论 -
LeetCode之11_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 (原创 2016-06-16 22:18:44 · 370 阅读 · 0 评论 -
LeetCode之12_Integer to Roman
题目原文:Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.Subscribe to see which companies asked this question题目分析:将数字转换为原创 2016-06-16 23:08:44 · 458 阅读 · 0 评论 -
LeetCode之26. Remove Duplicates from Sorted Array
题目原文:Given a sorted array nums, 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 by modi...原创 2018-05-16 23:35:23 · 149 阅读 · 0 评论 -
LeetCode之80. Remove Duplicates from Sorted Array II
题目原文:Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length.Do not allocate extra space for another array, you must do this by ...原创 2018-05-16 23:42:24 · 190 阅读 · 0 评论 -
LeetCode之33. 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 found...原创 2018-05-17 23:41:24 · 220 阅读 · 0 评论 -
LeetCode之14_Longest Common Prefix
题目原文:Write a function to find the longest common prefix string amongst an array of strings.题意分析:传入多个存储在vector容器中的字符串,计算其公共最长前缀,公共最长前缀要求是连续的,与动态规划的最长公共子序列不同为减少比较次数,可以逐个寻找两个字符串之间原创 2016-06-26 13:40:35 · 406 阅读 · 0 评论 -
LeetCode之13_Integer to Roman
题目原文:Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.题意分析:把一个给出的罗马数字转换成为阿拉伯数字表示的整数解题时将罗马数字对应的阿拉伯数字依次转换出来即可,需要注意,如果存在左边的罗原创 2016-06-26 13:16:14 · 392 阅读 · 0 评论 -
LeetCode之9_Palindrome Number
题目原文:Determine whether an integer is a palindrome. Do this without extra space.题意分析:不使用额外空间,判断给定的一个整数是否为回文整数。如果只是求回文数字很简单,题目的难度在于不使用额外的空间(此处认为除了传入参数,临时变量的使用为额外空间,运行过程中产生的栈对象不考虑)此处判断首尾是原创 2016-05-15 01:29:52 · 306 阅读 · 0 评论 -
LeetCode之147_Insertion Sort List
题目:Sort a linked list using insertion sort.分析:单链表的插入原创 2014-11-04 18:12:43 · 572 阅读 · 0 评论 -
LeetCode之148_Sort List
LeetCode之Sort List时间复杂度为O(n log n),空间复杂度为常量的单链表排序算法原创 2014-11-01 19:22:35 · 834 阅读 · 0 评论 -
LeetCode之186_Reverse Words in a String 字符串词序反转算法
给定一个字符串S,反转其中存在的单词顺序,将原创 2014-09-18 20:40:48 · 839 阅读 · 0 评论 -
LeetCode之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原创 2016-04-04 17:58:23 · 331 阅读 · 0 评论 -
LeetCode之3_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原创 2016-04-04 18:07:42 · 303 阅读 · 0 评论 -
LeetCode之4_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)).Subscribe t原创 2016-04-04 18:23:00 · 289 阅读 · 0 评论 -
LeetCode之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.Subscrib原创 2016-04-04 18:29:40 · 262 阅读 · 0 评论 -
LeetCode之6_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)P A H N原创 2016-04-04 18:58:57 · 327 阅读 · 0 评论 -
LeetCode之7_Reverse Integer
题目原文: Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Subscribe to see which companies asked this question 分析:将整数倒原创 2016-04-04 19:02:32 · 351 阅读 · 0 评论 -
LeetCode之8_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 po原创 2016-04-04 23:50:12 · 359 阅读 · 0 评论 -
LeetCode之81. Search in Rotated Sorted Array II.cpp
题目原文:Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., [0,0,1,2,2,5,6] might become [2,5,6,0,0,1,2]).You are given a target value to search. If found...原创 2018-05-17 23:45:18 · 215 阅读 · 0 评论