LeetCode
文章平均质量分 52
柯森锎
92年的小学生
展开
-
LeetCode#1.Two Sum
题目描述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 nums = [2, 7, 1原创 2016-07-13 19:22:02 · 204 阅读 · 0 评论 -
LeetCode 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(string s) { map<char,int>dig;原创 2016-10-22 23:48:59 · 332 阅读 · 0 评论 -
LeetCode 14. Longest Common Prefix (easy)
题目描述Write a function to find the longest common prefix string amongst an array of strings.代码class Solution {public: string longestCommonPrefix(vector<string>& strs) { int n_str=strs.size()原创 2016-10-23 16:12:14 · 307 阅读 · 0 评论 -
LeetCode 11. Container With Most Water(Two-Pointer 详解)
题目描述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 two原创 2016-10-11 21:05:51 · 403 阅读 · 0 评论 -
LeetCode 16. 3Sum Closest (Two-Pointer)
题目描述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 exac原创 2016-10-23 17:59:20 · 363 阅读 · 0 评论 -
LeetCode 15. 3Sum (Medium)
题目描述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.题目解析最直接的是三重循环; 由于要求去掉重复的答案,所以要先对nums排序;原创 2016-10-23 16:22:49 · 476 阅读 · 0 评论 -
LeetCode 32. Longest Valid Parentheses(hard)
题目描述Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.For “(()”, the longest valid parentheses substring is “()”, which原创 2016-09-29 18:59:08 · 328 阅读 · 0 评论 -
LeetCode 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 "2原创 2016-11-17 22:58:52 · 388 阅读 · 0 评论 -
LeetCode 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原创 2016-11-23 23:17:13 · 445 阅读 · 0 评论 -
LeetCode 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.题目解析将阿拉伯数字转换为罗马数字。 罗马数字表示方法: I-1,X-10,C-100,M-1000; V-5,L-50,D-500; 1. 相同的数字连写、所表示的数等原创 2016-10-22 23:22:41 · 282 阅读 · 0 评论 -
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-11 20:25:00 · 221 阅读 · 0 评论 -
LeetCode 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, and there exists one unique longest palindromic substring.题目解析找出最大的回文子串; 开始的想法是遍原创 2016-09-22 20:30:05 · 202 阅读 · 0 评论 -
LeetCode 7. Reverse Integer
题目描述Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321click to show spoilers.Have you thought about this? Here are some good questions to ask before coding. Bo原创 2016-09-23 22:07:59 · 196 阅读 · 0 评论 -
LeetCode 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 cas原创 2016-09-23 22:40:16 · 327 阅读 · 0 评论 -
LeetCode 2. Add Two Numbers
题目描述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 l原创 2016-09-20 21:46:31 · 341 阅读 · 0 评论 -
LeetCode 9. Palindrome Number
题目描述Determine whether an integer is a palindrome. Do this without extra space.题目解析注意负数不是回文数;代码class Solution {public: bool isPalindrome(int x) { if(x==0) { return true;原创 2016-09-23 23:09:42 · 284 阅读 · 0 评论 -
LeetCode 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 th原创 2016-09-21 19:27:54 · 259 阅读 · 0 评论 -
LeetCode 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:原创 2016-09-21 23:27:18 · 303 阅读 · 0 评论 -
LeetCode 10. Regular Expression Matching(hard)
题目描述Implement 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 st原创 2016-09-25 21:22:28 · 326 阅读 · 0 评论 -
LeetCode 19. Remove Nth Node From End of List
题目描述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 the second node from the end, the linked原创 2016-11-24 22:14:44 · 450 阅读 · 0 评论