|
|
08 2013 档案
摘要：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 the entire input string (not partial).The function prototype should be:bool i
阅读全文
摘要：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.思路：大整数运算的思路，模拟乘法运算代码：class Solution {public: string multiply(string num1, string num2) { int len1 = num1.size(), len2 = num2.size(), le...
阅读全文
摘要：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 run inO(n) time and uses constant space.找到第一个没有出现的正整数思路：http://tech-wonderland.net/blog/leetcode-first-missing-positive.html就是把出现的正整数a都放在a-1的位置，然后从头开始历遍
阅读全文
摘要：Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Each number inCmay only be usedoncein the combination.Note:All numbers (including target) will be positive integers.Elements in a combination (a1,a2, � ,ak) must
阅读全文
|
