leetCode
HelloWorld_EE
这个作者很懒,什么都没留下…
展开
-
《leetCode》: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原创 2015-11-03 19:52:14 · 1324 阅读 · 0 评论 -
《leetCode》: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 exactl原创 2015-11-03 20:16:20 · 691 阅读 · 0 评论 -
补充的算法题
题目描述题目是这样的:“一个双人游戏是这样玩的:给定一个非负正整数序列,你每次只能从序列头部取1个、2个或者3个数,取到的整数累加到你的得分上。两个人轮流如此,知道取完所有整数。每个人都足够聪明,每个人的目的是最大化自己的得分,请问第一个人最终的得分是多少?输入格式多组数据,每组数据第一行是一个正整数n,表示序列中数的个数。(n<=100000)第二行是n个空格分隔的非负整数,表示每个数,每原创 2015-11-04 09:52:10 · 454 阅读 · 0 评论 -
《leetCode》:Letter Combinations of a Phone Number
题目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:原创 2015-11-04 19:38:06 · 631 阅读 · 0 评论 -
《leetCode》: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 qua原创 2015-11-04 21:41:15 · 486 阅读 · 0 评论 -
《leetCode》:Search for a Range
题目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原创 2015-11-05 21:01:01 · 421 阅读 · 0 评论 -
《leetCode》:Reverse Nodes in k-Group
题目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.Yo原创 2015-11-07 22:16:44 · 541 阅读 · 0 评论 -
《leetCode》:Valid Parentheses
题目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原创 2015-11-06 22:12:43 · 439 阅读 · 0 评论 -
《leetCode》:Generate Parentheses(hard)
题目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:"((()))", "(()())", "(())()", "()(())", "()()()"错误的思原创 2015-11-07 20:08:52 · 479 阅读 · 0 评论 -
《leetCode》:Implement strStr()
题目Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.题意:实现函数strStr()的功能,strstr(str1,str2) 函数用于判断字符串str2是否是str1的子串。如果是,则该函数返回str2原创 2015-11-08 12:53:31 · 537 阅读 · 0 评论 -
《leetCode》:Pow(x, n)
题目Pow(x, n),即求x的n次方。思路此题是一个常规题,比较简单。利用简单的递归即可实现。实现代码如下:double myPow(double x, int n) { int symbol=1;//用来标识n是不是为正数 if(n==0){ return 1; }// if(n==1){// return x;// }原创 2015-11-08 13:26:07 · 460 阅读 · 0 评论 -
《leetCode》: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:For the return原创 2015-11-08 14:36:24 · 564 阅读 · 0 评论 -
《leetCode》:Rotate Image
题目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?题目大意:将一个数组按顺时针旋转90度。思路如果能够借用一个一样大的空间还是比较好做的。 将matrix[i][j]拷贝到t原创 2015-11-08 16:00:28 · 463 阅读 · 0 评论 -
《leetCode》:Permutations
题目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,1,2], and [3,2,1].思路思路与《剑指Offer》上面的这个题目的思路原创 2015-11-08 21:08:24 · 472 阅读 · 0 评论 -
《leetCode》: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], and [2,1,1].题目大意:就是原创 2015-11-08 22:06:13 · 550 阅读 · 0 评论 -
《leetCode》30道题小结
最近一个多星期每天晚上都会刷几个题,星期六和星期天的时候如果没有其它的事情的话会刷一整天,到目前为止,已经完成了30个题了,可能目前做的都是比较esay的题,没有遇到太大的困难,总之感觉挺爽的。不过有的题目的效率可能需要更加的来优化下。 总之,以后的每一天也会尽量坚持刷一两道题吧。看着自己刷过的题的感觉,真是挺爽的。 昨天(星期六)在图书馆还了下书,还带上了以前买的《代码大全》这本书,看了下原创 2015-11-08 22:32:55 · 974 阅读 · 0 评论 -
《leetCode》: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.题目大意:求两个任意长的全部由数字构成的字符串的乘积。思路由于题目已经说明了,两个字符串原创 2015-11-09 19:53:55 · 410 阅读 · 0 评论 -
《leetCode》:Count and Say
题目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, th原创 2015-11-09 22:11:06 · 523 阅读 · 0 评论 -
《leetCode》:Divide Two Integers
题目Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT./*完成两个数的除法,不能用乘法、除法、和求余运算思路:由于有上面的限制,因此只能用加法和减法来做此题*///函数中第一个参数为:被除数,第二个参数为:除数。//例如:如原创 2015-11-10 19:52:29 · 522 阅读 · 0 评论 -
《leetCode》: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 space.题意原创 2015-11-09 21:26:54 · 452 阅读 · 0 评论 -
《leetCode》:Search Insert Position
题目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.Her原创 2015-11-10 21:34:58 · 605 阅读 · 1 评论 -
《leetCode》:Next Permutation
题目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 or原创 2015-11-11 21:18:07 · 471 阅读 · 0 评论 -
《leetCode》: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 combination.原创 2015-11-12 20:40:19 · 521 阅读 · 0 评论 -
《leetCode》:Valid Sudoku
http://sudoku.com.au/TheRules.aspx/*思路:由于只是要我们检查一个Sudoku是否有效。并不是要我们求一个sudoku,因此我们只需要按照sudoku的定义来检查即可。 sudoku的要求如下:1、Each row must have the numbers 1-9 occuring just once. 2、Each column must have t原创 2015-11-11 22:33:29 · 527 阅读 · 0 评论 -
《leetCode》:Rotate List
题目Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.题目大意:将链表的后k个节点放在链表的头部。思路思路比较简单,就是,找到链表的倒数第原创 2015-11-12 22:13:31 · 520 阅读 · 0 评论 -
《leetCode》: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 number of原创 2015-11-12 20:30:49 · 554 阅读 · 0 评论 -
《leetCode》:Length of Last Word
题目Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is defined原创 2015-11-12 21:09:54 · 546 阅读 · 0 评论 -
《leetCode》:Ugly Number II
题目Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first 10 ug原创 2015-11-13 19:45:45 · 508 阅读 · 0 评论 -
《leetCode》:Ugly Number
题目Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly since it原创 2015-11-13 20:31:24 · 398 阅读 · 0 评论 -
《leetCode》: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] has th原创 2015-11-13 21:06:21 · 426 阅读 · 0 评论 -
《LeetCode》:Two Sum
《LeetCode》:Two Sum昨天刚说的准备去刷《程序员面试金典》上面的题,但是看了下那本书上面的题,感觉都没有什么意思,因此也就打算来刷了leetCode上面的题了。刷题的顺序选择了按照顺序来刷。今天开始了第一题:Two Sum 题目如下: 意思就是:在一个整型数组中,寻找两个数等于一个定值,返回这个数在数组中的下标,要注意的是:下标不是从0开始的。《剑指Offer》上也有类似原创 2015-10-29 20:40:10 · 730 阅读 · 0 评论 -
《leetCode》:add two num
题目描述如下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原创 2015-10-29 22:37:41 · 824 阅读 · 0 评论 -
《leetCode》:Median of Two Sorted Arrays
题目There are two sorted arrays nums1 and nums2 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)).思路一:边界太多,没有调出来思路:由于题目对时间复杂原创 2015-11-15 17:11:08 · 471 阅读 · 0 评论 -
《leetCode》:ZigZag Conversion
关于ZigZag的理解/*1、第i排从i开始2、 含numRows的每列相邻之间的元素的间隔为step=2*(numRows-1) 3、斜线上面的元素间隔为:step=j+step-2*i;其中j为s中的下标,i为行下标(从零开始) */ #include<stdio.h>#include<stdlib.h>#include<string.h> char* convert(char* s原创 2015-10-31 17:21:16 · 580 阅读 · 0 评论 -
《leetCode》:Reverse Integer
题目描述:Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321实现代码如下:#include<stdio.h>#include<stdlib.h>int reverse(int x) { long result=0;//这里设为long型,是为后面检查是否溢出in原创 2015-10-31 19:01:36 · 657 阅读 · 0 评论 -
《leetCode》:Convert String to Integer
题目描述Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cas原创 2015-10-31 21:33:28 · 1014 阅读 · 0 评论 -
《leetCode》:Minimum Path Sum
题目Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at a原创 2015-11-22 22:09:40 · 468 阅读 · 0 评论 -
《leetCode》:Count Primes
题目Description:Count the number of prime numbers less than a non-negative number, n.题目大意:统计小于n的素数的个数质数(prime number)又称素数,有无限个。一个大于1的自然数,除了1和它本身外,不能被其他自然数整除, 换句话说就是该数除了1和它本身以外不再有其他的因数;否则称为合数。 根据算术基本定理,原创 2015-11-16 19:24:36 · 530 阅读 · 0 评论 -
《leetCode》:Spiral Matrix II
题目Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6,原创 2015-11-21 20:27:24 · 409 阅读 · 0 评论 -
《leetCode》:Plus One
题目Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.题目大意:将用数组表示的一个数进行加1操作。其中数组的原创 2015-11-22 18:47:01 · 470 阅读 · 0 评论