每天一Leetcode
逗逗军001
c/c++
展开
-
Add Two Numbers
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it原创 2017-05-17 17:58:05 · 319 阅读 · 0 评论 -
17. 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:Digit string "原创 2017-08-02 20:53:41 · 259 阅读 · 0 评论 -
18. 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: The solution se原创 2017-08-03 13:30:42 · 183 阅读 · 0 评论 -
15. 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: The solution set must not contain dup原创 2017-07-26 11:22:43 · 210 阅读 · 1 评论 -
500. Keyboard Row
一、题目:Given a List of words, return the words that can be typed using letters of alphabet on only one row's of American keyboard like the image below.二、解题class Solution { /* 从第一个单词开始找,先找出该单词首字母在原创 2017-08-12 19:03:00 · 249 阅读 · 0 评论 -
575. Distribute Candies
一、问题:Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of the corresponding kind. You need to distribute t原创 2017-08-12 20:04:56 · 285 阅读 · 0 评论 -
566. Reshape the Matrix
一、题目:n MATLAB, there is a very useful function called 'reshape', which can reshape a matrix into a new one with different size but keep its original data.You're given a matrix represented by a two-dime原创 2017-08-05 19:46:16 · 260 阅读 · 0 评论 -
485. Max Consecutive Ones
一、题目:Given a binary array, find the maximum number of consecutive 1s in this array.Example 1:Input: [1,1,0,1,1,1] Output: 3 Explanation: The first two digits or the last three digits are consecutive 1s原创 2017-08-06 08:54:00 · 192 阅读 · 0 评论 -
27. Remove Element
一、问题: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 with constant memory.The原创 2017-08-06 19:03:13 · 183 阅读 · 0 评论 -
561. Array Partition I
一、问题: Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as原创 2017-08-06 19:12:13 · 211 阅读 · 0 评论 -
448、Find All Numbers Disappeared in an Array
一、问题: Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling your原创 2017-08-07 09:27:18 · 215 阅读 · 0 评论 -
10. Regular Expression Matching
题目:mplement regular expression matching with support for '.' and '*'.'.' Matches any single character. '*' Matches zero or more of the preceding element.The matching should cover the entire input strin原创 2017-07-19 17:03:22 · 175 阅读 · 0 评论 -
9. Palindrome Number
题目:Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers. Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of converting the int原创 2017-07-19 12:18:34 · 157 阅读 · 0 评论 -
3. Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. Examples: Given “abcabcbb”, the answer is “abc”, which the length is 3. Given “bbbbb”, the answer is “b”, with原创 2017-05-18 11:09:54 · 177 阅读 · 0 评论 -
4. 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)).Example 1:nums1 = [1, 3] num原创 2017-05-20 00:47:15 · 203 阅读 · 0 评论 -
5. Longest Palindromic Substring
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example:Input: "babad"Output: "bab"Note: "aba" is also a valid answer.Example:Input: "原创 2017-06-30 19:20:42 · 237 阅读 · 0 评论 -
6. ZigZag Conversion
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)P A H N A P L S I I G Y原创 2017-07-06 20:20:22 · 181 阅读 · 0 评论 -
8. String to Integer (atoi)
题目 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 case原创 2017-07-16 20:41:12 · 199 阅读 · 0 评论 -
11. Container With Most Water
题目: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) and (i, 0). Find tw原创 2017-07-20 17:39:17 · 167 阅读 · 0 评论 -
7. Reverse Integer
一、题目描述:Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321click to show spoilers.Note: The input is assumed to be a 32-bit signed integer. Your function should re原创 2017-07-08 13:44:09 · 155 阅读 · 0 评论 -
12. Integer to Roman
题目:Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.分析:罗马数字的规律: 相同的数字连写、所表示的数等于这些数字相加得到的数、如:Ⅲ=3; 小的数字在大的数字的右边、所表示的数等于这些数字相加得到的数、 如:Ⅷ=8、Ⅻ=12; 小原创 2017-07-21 10:23:05 · 191 阅读 · 0 评论 -
13. Roman to Integer
题目:Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.分析:此题将罗马数字转换成数字,上题已经分析了罗马数字的规律了 左边数字较小减去,右边数字相加。解题:class Solution { public:int romanToInt(原创 2017-07-21 11:32:33 · 191 阅读 · 0 评论 -
14. Longest Common Prefix
题目Write a function to find the longest common prefix string amongst an array of strings. 分析:本题是求N个字符串的公共最长前缀,两两比较即可确定。class Solution { public: /** * * @return: The longest common prefix原创 2017-07-21 15:24:29 · 186 阅读 · 0 评论 -
121. Best Time to Buy and Sell Stock
一、问题:Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),原创 2017-08-07 15:02:06 · 271 阅读 · 0 评论