- 博客(12)
- 资源 (18)
- 收藏
- 关注
原创 LeetCode-----53. Maximum Subarray(最大子集合)
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4],the contiguous subarray [4,-1,2,1] ha
2016-10-28 16:02:07 368
原创 LeetCode---50. Pow(x, n)(指数运算x的n次方)
Implement pow(x, n).Subscribe to see which companies asked this question//思路:主要考察越界,n为负数等问题方法一:APIpublic class Solution { public double myPow(double x, int n) { // double Mat
2016-10-25 15:20:33 445
原创 LeetCode----49. 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: Al
2016-10-25 14:55:04 310
原创 LeetCode-----48. Rotate Image(二维矩阵旋转90度)
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?
2016-10-24 19:39:05 1638
原创 LeetCode-----46.Permutations&&47.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], [2,1
2016-10-22 15:20:21 416
原创 LeetCode--------45. Jump Game II(跳跃游戏--最短路径)
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 maximum jump length at that position.Your goal i
2016-10-22 15:02:40 1183
原创 LeetCode------44. Wildcard Matching(?*匹配)
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 t
2016-10-21 15:38:08 303
原创 LeetCode-------43. 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.Converting the input string to integ
2016-10-14 11:46:06 393
原创 LeetCode------42. 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]
2016-10-13 13:25:38 1299
原创 LeetCode----41. First Missing Positive
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
2016-10-10 17:39:25 194
原创 LeetCde----40. 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
2016-10-10 11:24:20 292
原创 LeetCode--------39. 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 numb
2016-10-06 22:26:11 235
Halcon 实现对datamatrix工业二维码识别(包含c++程序)
2017-12-26
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人