02 2015 档案
摘要：Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2]have the following unique perm...
阅读全文
摘要：Given a collection of 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,...
阅读全文
摘要：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 maximu...
阅读全文
摘要：Implement wildcard pattern matching with support for'?'and'*'.'?' Matches any single character.'*' Matches any sequence of characters (including the e...
阅读全文
摘要：Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-nega...
阅读全文
摘要：Given an unsorted integer array, find the first missing positive integer.For example,Given[1,2,0]return3,and[3,4,-1,1]return2.Your algorithm should ru...
阅读全文
摘要：Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Each number ...
阅读全文
摘要：Note:All numbers (including target) will be positive integers.Elements in a combination (a1,a2, … ,ak) must be in non-descending order. (ie,a1≤a2≤ … ≤...
阅读全文
摘要：The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1is read off as"one 1"or11.11is read off as"tw...
阅读全文
摘要：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 or...
阅读全文
摘要：方法一：暴力搜索针对S中每个字符开始搜索一次长度为wordLen*len的字符串，是否包含L中的所有单词。这个很好统计，Map就可以直接搞定。思路很好想，同时也很费时。超时class Solution { map m_map; public: void initMap(ve...
阅读全文
摘要：Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.思路：用 divisor 右移，计算出最大的位数，然后不断比较 更新过的divi...
阅读全文
摘要：Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Update (2014-11-02):The si...
阅读全文
摘要：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 mat...
阅读全文
摘要：Given a linked list, reverse the nodes of a linked listkat a time and return its modified list.If the number of nodes is not a multiple ofkthen left-o...
阅读全文
摘要：Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algor...
阅读全文
摘要：Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.方法一：实现merger2Lists，然后两个两个List Merge，直到最后，不过超时了class So...
阅读全文
摘要：Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))...
阅读全文
摘要：Given a linked list, remove thenthnode from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After re...
阅读全文
摘要：Write a function to find the longest common prefix string amongst an array of strings.思路： 很简单，其他字符串和第一个字符串比较，一个一个字符比较，反正最长不会超过第一个字符串的长度。class Solution...
阅读全文
摘要：Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon...
阅读全文
摘要：Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.思路：从各位向前处理，当前字符代表的数比后面一位字符代表的数大（包括等于），就加，小就减...
阅读全文
摘要：Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.罗马数字是由字符I,V,X,L,C,D,M等等表示的，其中I = 1;V = 5;X =...
阅读全文
摘要：Givennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such that the two endpoints of ...
阅读全文
摘要：邮件协议需要配置client 端 和 server 端，在linux redhat 下client 端： 使用linux 自带的Evolution，2.12.3， 主要配置在preferrence 下server 端： 启动 sendmail 作为服务器，供收发使用http://blog.csdn...
阅读全文
摘要：转载http://coolshell.cn/articles/12103.html在知乎上，有个人问了这样的一个问题——为什么vfork的子进程里用return，整个程序会挂掉，而且exit()不会？并给出了如下的代码，下面的代码一运行就挂掉了，但如果把子进程的return改成exit(0)就没事。...
阅读全文
