面试
文章平均质量分 79
HarryHuang1990
勤勤恳恳兢兢业业...
展开
-
LeetCode 014 Longest Common Prefix
【题目】Write a function to find the longest common prefix string amongst an array of strings.【题意】求一组字符串的最长公共前缀【思路】使用归并思想求解要求字符串[1,2,..,k,k+1,...n]的最大公共前缀,先分别求[1,2,...k]和[k+1,...,n]的公共前缀原创 2014-05-16 09:02:21 · 717 阅读 · 0 评论 -
LeetCode: Letter Combinations of a Phone Number [018]
【题目】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 "23"Output: ["ad", "ae", "af", "bd", "be", "bf",原创 2014-05-16 13:18:47 · 712 阅读 · 0 评论 -
LeetCode 017 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:Elements in a quadruplet (a,b,c,d) must be in non-descending ord原创 2014-05-16 11:45:18 · 742 阅读 · 0 评论 -
LeetCode: Remove Nth Node From End of List [019]
【题目】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 list becomes 1->2->3->5.Note:Given n will原创 2014-05-16 13:49:52 · 691 阅读 · 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 two lines, which together with x-axis forms a contain原创 2014-05-15 22:04:52 · 1421 阅读 · 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.【题意】给定一个整数,将其表示成罗马数字【思路】罗马数字中只使用如下七个基值字母:M,D,C,L,X,V,I,分别用来表示1000、500、100、50、10、5、1。罗马数组数规则:基本数字Ⅰ、X 、C 中的任何一个,自身连用构成数目,或者放在大数的右边连用原创 2014-05-15 22:52:03 · 677 阅读 · 0 评论 -
LeetCode: Swap Nodes in Pairs [023]
【题目】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 may not modify the values in the list, only nodes it原创 2014-05-16 20:59:40 · 715 阅读 · 0 评论 -
LeetCode: Reverse Nodes in k-Group [024]
【题目】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.You may not alter the values in the nodes, only n原创 2014-05-16 22:10:32 · 704 阅读 · 0 评论 -
LeetCode 016 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 exactly one solution. For example, given array S = {原创 2014-05-16 11:20:35 · 656 阅读 · 0 评论 -
LeetCode: Remove Duplicates from Sorted Array [025]
【题目】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 constant memory.For example,Given input array A原创 2014-05-16 22:23:57 · 843 阅读 · 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.【题意】把罗马数转换为整数【思路】罗马数字中只使用如下七个基值字母:M,D,C,L,X,V,I,分别用来表示1000、500、100、50、10、5、1。大体思路是每个罗马字母对应的值相加即可,但需要处理900, 400, 90, 40, 9, 4这几个特殊原创 2014-05-16 08:45:13 · 810 阅读 · 0 评论 -
LeetCode: Valid Parentheses [020]
【题目】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 but "(]" and "([)]" are not.【题意】 判断给定的字符串是否是合法的原创 2014-05-16 14:04:13 · 708 阅读 · 0 评论 -
LeetCode: Generate Parentheses [021]
【题目】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:"((()))", "(()())", "(())()", "()(())", "()()()"【题意】 给定n对括号,输出所有可行的括号组合字符串。所谓合法,就是可以Valid Pare原创 2014-05-16 20:17:24 · 678 阅读 · 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 be in non-descending order. (ie, a ≤ b ≤ c)The so原创 2014-05-16 10:55:55 · 951 阅读 · 0 评论 -
LeetCode: Merge k Sorted Lists [022]
【题目】Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.【题意】 合并K个有序链表【思路】 归并Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For原创 2014-05-16 20:32:26 · 652 阅读 · 0 评论 -
LeetCode: Substring with Concatenation of All Words [029]
【题目】You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and without any intervening characters.For example, given:S:原创 2014-05-17 14:47:04 · 716 阅读 · 0 评论 -
LeetCode: Search in Rotated Sorted Array [032]
【题目】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 index, otherwise return -1.You may assume no du原创 2014-05-19 10:35:41 · 613 阅读 · 0 评论 -
LeetCode: Remove Element [026]
【题目】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.【题意】删除数组中指定的值。不关心在新数组的后面即数组尾部留下了什么值。【思路】思路同Remo原创 2014-05-17 09:27:11 · 746 阅读 · 0 评论 -
LeetCode: Divide Two Integers [028]
【题目】Divide two integers without using multiplication, division and mod operator.【题意】 计算两个数的商,不能使用乘、除、取余操作【思路】 用加法,确定多少除数相加其和恰好<=被除数 为了提高算法效率,利用贪心思想,采用滚雪球式的翻倍叠加策略,使和快速逼近被除数 集中特殊情况需要注意: 1. 结果是负数原创 2014-05-17 13:58:25 · 831 阅读 · 0 评论 -
LeetCode: Next Permutation [030]
【题目】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 order (ie, sorted in ascending order).The replac原创 2014-05-17 15:27:08 · 743 阅读 · 0 评论 -
LeetCode: Longest Valid Parentheses [031]
【题目】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 "()", which has length = 2.Another example is ")()())", whe原创 2014-05-19 08:45:42 · 779 阅读 · 0 评论 -
LeetCode: Search for a Range [033]
【题目】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 in the array, return [-1, -1].For example,Given [5原创 2014-05-19 11:39:22 · 718 阅读 · 0 评论 -
LeetCode: Search Insert Position [034]
【题目】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.Here are few examples.[1,3,5,6], 5 → 2[1,3,5,6]原创 2014-05-19 12:58:13 · 777 阅读 · 0 评论 -
LeetCode-001 Two Sum
LeetCode-001 Two Sum 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 index1 must be less than index2原创 2014-05-13 13:45:53 · 1323 阅读 · 0 评论 -
LeetCode-003 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 "bbbbb" the longest substring is "b", with the len原创 2014-05-13 16:16:43 · 796 阅读 · 0 评论 -
LeetCode-004 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 linked list.Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)Out原创 2014-05-13 17:26:10 · 753 阅读 · 0 评论 -
LeetCode: Sudoku Solver [036]
【题目】Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that there will be only one unique solution.A sudoku puzzle......and its solution numbers marked in red.原创 2014-05-19 22:46:47 · 1058 阅读 · 0 评论 -
LeetCode: Valid Sudoku [035]
【题目】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 sudoku which is valid.Note:A valid Sudoku board (par原创 2014-05-19 13:42:02 · 772 阅读 · 0 评论 -
LeetCode: Count and Say [037]
【题目】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, then one 1" or 1211.Given an integer n, generate原创 2014-05-20 08:35:14 · 750 阅读 · 0 评论 -
leetCode-002 Median of Two Sorted Arrays
leetCode-002 Median of Two Sorted Arrays【题目】There are two sorted arrays A and B 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)).【题意】有两个有序的数组,找出这两数组整合后的中位数,要求时间复杂度O(nlogn)原创 2014-05-13 15:05:53 · 936 阅读 · 0 评论 -
LeetCode 006 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 NA P L S I I GY I RAnd then read line by line: "PAHNAPLSI原创 2014-05-14 09:29:09 · 688 阅读 · 0 评论 -
LeetCode: First Missing Positive [040]
【题目】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 space.【题意】 给定一个数组,找出第一个缺失的正数。时间复杂度O(n)原创 2014-05-20 14:30:18 · 748 阅读 · 0 评论 -
LeetCode: Combination Sum [038]
【题目】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 of times.Note:All numbers (including target) w原创 2014-05-20 09:02:12 · 706 阅读 · 0 评论 -
LeetCode: Combination Sum II [039]
【题目】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 combination.Note:All numbers (including target) will be原创 2014-05-20 09:21:41 · 1050 阅读 · 0 评论 -
LeetCode 009 Palindrome Number
【题目】Determine whether an integer is a palindrome. Do this without extra space.【题意】题意判断一个整数是否是回文数注意一下几点: 1. 不能用额外的空间 2. 负数不是回文数原创 2014-05-14 13:43:02 · 735 阅读 · 0 评论 -
LeetCode 010 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 string (not partial).The function prototype shoul原创 2014-05-14 14:20:21 · 1051 阅读 · 0 评论 -
LeetCode 007 Reverse Integer
【题目】Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321【题意】 反转int型整数,输出的也是int型的整数【思路】 如要考虑两种特殊情况: 1. 类似100这样的整数翻转之后为1 2. 翻转之后的值溢出该如何处理, 本题的测试用例中似乎没有给出溢出的情况原创 2014-05-14 11:03:10 · 810 阅读 · 0 评论 -
LeetCode: Restore IP Addresses [093]
【题目】Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given "25525511135",return ["255.255.11.135", "255.255.111.35"]. (Order does not matter)【题意】给定一个字符串,恢复并返回所有符合条件的IP串【思路】原创 2014-06-01 10:28:57 · 1066 阅读 · 0 评论 -
LeetCode: Unique Binary Search Trees [095]
【题目】Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2 1 \ / / / \ \ 3 2 1原创 2014-06-01 10:33:37 · 1389 阅读 · 0 评论 -
LeetCode: Trapping Rain Water [041]
【题目】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], return 6.The above elevation map is represente原创 2014-05-20 22:07:03 · 696 阅读 · 0 评论