Loading

摘要: LeetCode上的题很不错,都短小精悍。先说说我自己。本科一直都是偏硬件,做些单片机、FPGA的东西。本科毕业设计写了个Android APP,控制外围电路(一个小车)。可以通过Android手机的重力感应和按钮来控制小车的运动。目前在读研,前段时间去XX公司实习了一段时间,自己画了块电路板,调F... 阅读全文
posted @ 2015-02-07 21:42 Yano_nankai 阅读(472) 评论(0) 推荐(0) 编辑
摘要: 题目要求:Pow(x, n)Implement pow(x,n).代码如下:class Solution {public: //采用二分法 //时间复杂度 O(logn),空间复杂度 O(1) double pow(double x, int n) { ... 阅读全文
posted @ 2015-02-07 21:26 Yano_nankai 阅读(136) 评论(0) 推荐(0) 编辑
摘要: 题目要求:AnagramsGiven an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.分析:参考网址:http://www.cnblo... 阅读全文
posted @ 2015-02-07 21:22 Yano_nankai 阅读(149) 评论(0) 推荐(0) 编辑
摘要: 题目要求:Rotate ImageYou are given annxn2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?代码... 阅读全文
posted @ 2015-02-07 21:09 Yano_nankai 阅读(141) 评论(0) 推荐(0) 编辑
摘要: 题目要求:Permutations IIGiven a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2]have the f... 阅读全文
posted @ 2015-02-07 21:04 Yano_nankai 阅读(144) 评论(0) 推荐(0) 编辑
摘要: 题目要求:Permutations(全排列)Given a collection of numbers, return all possible permutations.For example,[1,2,3]have the following permutations:[1,2,3],[1,3,... 阅读全文
posted @ 2015-02-07 21:02 Yano_nankai 阅读(202) 评论(0) 推荐(0) 编辑
摘要: 题目要求:Jump Game IIGiven an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array repre... 阅读全文
posted @ 2015-02-07 20:48 Yano_nankai 阅读(218) 评论(0) 推荐(0) 编辑
摘要: 题目要求:Wildcard MatchingImplement wildcard pattern matching with support for'?'and'*'.'?' Matches any single character.'*' Matches any sequence of chara... 阅读全文
posted @ 2015-02-07 20:32 Yano_nankai 阅读(152) 评论(0) 推荐(0) 编辑
摘要: 题目要求:Multiply StringsGiven two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily l... 阅读全文
posted @ 2015-02-07 20:29 Yano_nankai 阅读(132) 评论(0) 推荐(0) 编辑
摘要: 题目要求:Trapping Rain WaterGivennnon-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able ... 阅读全文
posted @ 2015-02-07 20:21 Yano_nankai 阅读(174) 评论(0) 推荐(0) 编辑
摘要: 题目要求:First Missing PositiveGiven an unsorted integer array, find the first missing positive integer.For example,Given[1,2,0]return3,and[3,4,-1,1]retur... 阅读全文
posted @ 2015-02-07 20:14 Yano_nankai 阅读(149) 评论(0) 推荐(0) 编辑
摘要: 题目要求:Combination Sum IIGiven a collection of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate number... 阅读全文
posted @ 2015-02-07 18:47 Yano_nankai 阅读(167) 评论(0) 推荐(0) 编辑
摘要: 题目要求:Combination SumGiven a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT... 阅读全文
posted @ 2015-02-07 18:43 Yano_nankai 阅读(115) 评论(0) 推荐(0) 编辑
摘要: 题目要求:Count and SayThe count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1is read off as"one 1"or11.1... 阅读全文
posted @ 2015-02-07 18:39 Yano_nankai 阅读(93) 评论(0) 推荐(0) 编辑
摘要: 题目要求:Sudoku SolverWrite a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character'.'.You may assume tha... 阅读全文
posted @ 2015-02-07 17:58 Yano_nankai 阅读(161) 评论(0) 推荐(0) 编辑
摘要: 题目要求:Valid SudokuDetermine if a Sudoku is valid, according to:Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells... 阅读全文
posted @ 2015-02-07 17:51 Yano_nankai 阅读(172) 评论(0) 推荐(0) 编辑
摘要: 题目要求:Search Insert PositionGiven a sorted array and a target value, return the index if the target is found. If not, return the index where it would b... 阅读全文
posted @ 2015-02-07 17:33 Yano_nankai 阅读(132) 评论(0) 推荐(0) 编辑
摘要: 题目要求:Search for a RangeGiven a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime comple... 阅读全文
posted @ 2015-02-07 17:31 Yano_nankai 阅读(129) 评论(0) 推荐(0) 编辑
摘要: 题目要求:Search in Rotated Sorted ArraySuppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 ... 阅读全文
posted @ 2015-02-07 17:22 Yano_nankai 阅读(129) 评论(0) 推荐(0) 编辑
摘要: 题目描述:Longest Valid ParenthesesGiven a string containing just the characters'('and')', find the length of the longest valid (well-formed) parentheses s... 阅读全文
posted @ 2015-02-07 17:18 Yano_nankai 阅读(146) 评论(0) 推荐(0) 编辑