LeetCode
文章平均质量分 57
ZeeCoder
这个作者很懒,什么都没留下…
展开
-
【一天一道LeetCode】#328 Odd Even Linked List
一天一道LeetCode系列Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You should try to原创 2016-03-29 11:46:11 · 482 阅读 · 0 评论 -
【一天一道LeetCode】 #1 Two Sum
一天一道LeetCode系列Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution.Example: Given num原创 2016-03-30 15:06:15 · 1115 阅读 · 0 评论 -
【一天一道leetcode】 #2 Add Two Numbers
一天一道leetcode系列 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 ret原创 2016-03-30 16:47:25 · 665 阅读 · 0 评论 -
【一天一道LeetCode】#4 Median of Two Sorted Arrays
一天一道LeetCode(一)题目 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)).给定两个排好序的数原创 2016-04-01 14:58:38 · 1082 阅读 · 4 评论 -
【一天一道LeetCode】#6 ZigZag Conversion
一天一道LeetCode系列(一)题目 The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)原创 2016-04-03 16:47:22 · 531 阅读 · 0 评论 -
【一天一道LeetCode】#7. Reverse Integer
一天一道LeetCode系列(一)题目 Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321(二)解题这题看上去很简单,动笔一挥之下,写出如下代码:class Solution {public: int reverse(int x) {原创 2016-04-04 15:42:43 · 694 阅读 · 0 评论 -
【一天一道LeetCode】#8. String to Integer (atoi)
一天一道LeetCode(一)题目 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原创 2016-04-04 16:42:57 · 528 阅读 · 0 评论 -
【一天一道LeetCode】#9. Palindrome Number
一天一道LeetCode系列(一)题目 Determine whether an integer is a palindrome. Do this without extra space. Some hints: Could negative integers be palindromes? (ie, -1) If you are thinking of conver原创 2016-04-05 15:04:28 · 600 阅读 · 0 评论 -
【一天一道LeetCode】#11Container With Most Water
一天一道LeetCode系列(一)题目 Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) an原创 2016-04-06 23:24:20 · 562 阅读 · 0 评论 -
【一天一道LeetCode】#15 3Sum
一天一道LeetCode系列(一)题目 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.For example, given array原创 2016-04-12 11:40:04 · 694 阅读 · 0 评论 -
【一天一道LeetCode】#12 Integer to Roman
一天一道LeetCode系列(一)题目 Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.(二)解题将整形数字转换成罗马数字 罗马数字共有七个,即I(1),V(5),X(10),L(50),C(100),D(500),M原创 2016-04-08 15:40:59 · 547 阅读 · 0 评论 -
【一天一道LeetCode】#13. Roman to Integer
一天一道LeetCode系列(一)题目 Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.(二)解题和上一题相反,这题将罗马数字转换成整形数。 注意到 4,9,40,90,400,900这些特殊的数字的区别就不难写出代码原创 2016-04-08 15:45:53 · 561 阅读 · 0 评论 -
【一天一道LeetCode】#26. Remove Duplicates from Sorted Array
一天一道LeetCode系列(一)题目 Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, you mus原创 2016-04-25 14:41:15 · 1019 阅读 · 0 评论 -
【一天一道LeetCode】#28. Implement strStr()
一天一道LeetCode系列(一)题目 Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.(二)解题第一种解法:朴素匹配算法/*两个指针,分别指向两个字符串的首字符如果相等则一起向后移原创 2016-04-25 16:34:17 · 3661 阅读 · 0 评论 -
【一天一道LeetCode】#25. Reverse Nodes in k-Group
一天一道LeetCode系列(一)题目 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 s原创 2016-04-23 15:56:07 · 583 阅读 · 0 评论 -
【一天一道LeetCode】#27. Remove Element
一天一道LeetCode系列(一)题目 Given an array and a value, remove all instances of that value in place and return the new length. Do not allocate extra space for another array, you must do this in place wi原创 2016-04-25 14:41:55 · 690 阅读 · 0 评论 -
【一天一道LeetCode】#16. 3Sum Closest
一天一道LeetCode系列(一)题目: 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 in原创 2016-04-13 21:28:09 · 533 阅读 · 0 评论 -
【一天一道LeetCode】#29. Divide Two Integers
一天一道LeetCode系列(一)题目 Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT.(二)解题这题看起来很简单,一开始想到的方法就是从0开始一次累加除数,一直到比被除数大为止,好无悬念,这样做的结果就是超时了原创 2016-04-26 18:02:45 · 614 阅读 · 0 评论 -
【一天一道LeetCode】#14 Longest Common Prefix
一天一道LeetCode系列(一)题目: Write a function to find the longest common prefix string amongst an array of strings.(二)题意求一组字符串中的最长前缀字符串。 举例:字符串组:abc,ab,abdef,abws 最长前缀字符串:ab我的解法是先求出这组字符串中最短的,然后依次匹配,遇到不同原创 2016-04-10 22:50:59 · 508 阅读 · 0 评论 -
【一天一道LeetCode】#31. Next Permutation
一天一道LeetCode系列(一)题目 Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it原创 2016-04-27 15:13:18 · 581 阅读 · 0 评论 -
【一天一道LeetCode】#17. Letter Combinations of a Phone Number
一天一道LeetCode(一)题目 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 be原创 2016-04-14 17:18:37 · 646 阅读 · 0 评论 -
【一天一道LeetCode】#47. Permutations II
一天一道LeetCode系列(一)题目 Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example, [1,1,2] have the following unique permutations:原创 2016-05-10 16:05:44 · 650 阅读 · 0 评论 -
【一天一道LeetCode】#46. Permutations
一天一道LeetCode系列(一)题目 Given a collection of distinct 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原创 2016-05-10 14:01:26 · 650 阅读 · 0 评论 -
【一天一道LeetCode】#18. 4Sum
一天一道LeetCode(一)题目 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.原创 2016-04-15 21:07:16 · 495 阅读 · 0 评论 -
【一天一道LeetCode】#32. Longest Valid Parentheses
一天一道LeetCode系列(一)题目 Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring. For “(()”, the longest valid parentheses原创 2016-04-28 21:48:24 · 716 阅读 · 0 评论 -
【一天一道LeetCode】#59. Spiral Matrix II
一天一道LeetCode系列(一)题目 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:原创 2016-05-24 16:22:46 · 862 阅读 · 0 评论 -
【一天一道LeetCode】#30. Substring with Concatenation of All Words
注:这道题之前跳过了,现在补回来一天一道LeetCode系列(一)题目 You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation of e原创 2016-05-24 21:54:22 · 3110 阅读 · 0 评论 -
【一天一道LeetCode】#19. Remove Nth Node From End of List
一天一道LeetCode系列(一)题目 Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing原创 2016-04-16 22:45:42 · 491 阅读 · 0 评论 -
【一天一道LeetCode】#20. Valid Parentheses
一天一道LeetCode系列(一)题目 Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid. The brackets must close in the correct order, “()” and原创 2016-04-17 22:03:31 · 667 阅读 · 0 评论 -
【一天一道LeetCode】#60. Permutation Sequence.
一天一道LeetCode系列(一)题目 The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, We get the following sequence (ie, for n = 3):原创 2016-05-25 10:50:57 · 3788 阅读 · 2 评论 -
【一天一道LeetCode】#38. Count and Say
一天一道LeetCode系列(一)题目 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原创 2016-04-30 22:28:54 · 587 阅读 · 0 评论 -
【一天一道LeetCode】#34. Search for a Range
一天一道LeetCode系列(一)题目 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原创 2016-05-01 11:30:12 · 493 阅读 · 0 评论 -
【一天一道LeetCode】#62. Unique Paths
一天一道LeetCode系列(一)题目 A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below). The robot can only move either down or right at any point in time. The robo原创 2016-05-25 21:52:10 · 1269 阅读 · 0 评论 -
【一天一道LeetCode】#61. Rotate List
一天一道LeetCode系列(一)题目 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.(二)解题本题的思原创 2016-05-25 21:52:47 · 1160 阅读 · 0 评论 -
【一天一道LeetCode】#63. Unique Paths II
一天一道LeetCode(一)题目 Follow up for “Unique Paths”: Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empty space is marked as 1 and 0原创 2016-05-26 09:29:55 · 3412 阅读 · 3 评论 -
【一天一道LeetCode】#33. Search in Rotated Sorted Array
一天一道LeetCode 本系列文章已全部上传至我的github,地址: https://github.com/Zeecoders/LeetCode 欢迎转载,转载请注明出处(一)题目 Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5原创 2016-05-26 10:58:58 · 2504 阅读 · 0 评论 -
【一天一道LeetCode】#36. Valid Sudoku
一天一道LeetCode 本系列文章已全部上传至我的github,地址:https://github.com/Zeecoders/LeetCode 欢迎转载,转载请注明出处(一)题目 Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board cou原创 2016-05-26 11:43:25 · 669 阅读 · 0 评论 -
【一天一道LeetCode】#35. Search Insert Position
一天一道LeetCode系列(一)题目 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原创 2016-05-02 17:43:54 · 3107 阅读 · 0 评论 -
【一天一道LeetCode】#21. Merge Two Sorted Lists
一天一道LeetCode系列(一)题目 Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.(二)解题这题是剑指offer上的老题了,剑指上面用的是递归,我写了个非递原创 2016-04-17 22:37:10 · 678 阅读 · 0 评论 -
【一天一道LeetCode】#39. Combination Sum
一天一道LeetCode系列(一)题目 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原创 2016-05-03 23:21:08 · 3139 阅读 · 0 评论