LeetCode
文章平均质量分 56
SeaIsGod
这个作者很懒,什么都没留下…
展开
-
leetcode 7. Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321 解:两种解法,时间复杂度要看测试样例。class Solution {public: int reverse(int x) { int y = 0, tmp = 0;原创 2017-05-23 17:28:07 · 309 阅读 · 0 评论 -
leetcode 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 linei is at (i, ai) and (i, 0). Find t原创 2017-06-10 15:20:35 · 241 阅读 · 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.解:主要使用查表法代码:class Solution {public: string intToRoman(int num) { string原创 2017-06-10 15:37:21 · 271 阅读 · 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 l原创 2017-06-25 11:42:47 · 280 阅读 · 0 评论 -
leetcode 20. 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 b原创 2017-06-25 12:26:40 · 247 阅读 · 0 评论 -
leetcode 21. Merge Two Sorted Lists
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解:简单题,合并两个有序的链表/** * Definition for singly-linked list.原创 2017-06-25 14:03:53 · 256 阅读 · 0 评论 -
leetcode 22. Generate Parentheses
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: [ "((()))", "(()())", "(())()", "()(()原创 2017-06-28 10:43:38 · 240 阅读 · 0 评论 -
leetcode 23. Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.解:这一题没啥特别好的思路,想到的就是两两合并直至结束;还有一种跟两个链表合并差不多,把每个链表的表头元素进行比较,但是需要找到其中值最小的那个节点,感觉复杂度也不小,但是觉得可以利用一些特殊的数原创 2017-06-28 11:07:33 · 246 阅读 · 0 评论 -
leetcode 24. Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. Yo原创 2017-07-16 21:31:52 · 240 阅读 · 0 评论 -
leetcode 25. 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.k is a positive integer and is less than or equal to the length of the linked list. If the number o原创 2017-07-17 10:36:42 · 324 阅读 · 0 评论 -
leetcode 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.Th原创 2017-07-21 19:37:06 · 279 阅读 · 0 评论 -
leetcode 26. Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear onlyonce and return the new length.Do not allocate extra space for another array, you must do this in place with原创 2017-07-22 10:28:54 · 317 阅读 · 0 评论 -
leetcode 28. Implement strStr()
Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.解:KMP算法挺难理解的,看了几遍记住之后,做到这题只记得大体的思路但是算法细节有不理解了,先来个brute-force算法压压惊,再去看原创 2017-07-22 10:32:13 · 391 阅读 · 0 评论 -
leetcode 10. Regular Expression Matching
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原创 2017-06-10 10:45:23 · 230 阅读 · 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 s原创 2017-06-18 21:01:05 · 377 阅读 · 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 stri原创 2017-06-18 16:35:18 · 273 阅读 · 0 评论 -
leetcode 5. Longest Palindromic Substring Add to List
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.原创 2017-05-14 17:31:35 · 373 阅读 · 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 "原创 2017-05-07 20:52:21 · 217 阅读 · 0 评论 -
leetcode 2. 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 i原创 2017-05-07 19:49:34 · 311 阅读 · 0 评论 -
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, and you may not use the sam原创 2017-04-26 14:09:16 · 383 阅读 · 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 case原创 2017-05-27 11:38:35 · 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:nums1 =原创 2017-05-09 11:00:24 · 225 阅读 · 0 评论 -
leetcode 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 NA P L S I原创 2017-05-17 21:48:31 · 246 阅读 · 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) { int roman[2原创 2017-06-15 20:07:51 · 263 阅读 · 0 评论 -
leetcode 14. Longest Common Prefix
这题就是要求解所有字符串中最长前缀,可以将所有字符串的每一列进行遍历解:class Solution {public: string longestCommonPrefix(vector& strs) { string prefix = ""; int id1 = 0, id2 = 0; int len = strs.size();原创 2017-06-17 19:13:08 · 240 阅读 · 0 评论 -
leetcode 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 du原创 2017-06-18 11:15:35 · 267 阅读 · 0 评论 -
leetcode 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 th原创 2017-06-02 11:36:22 · 311 阅读 · 0 评论 -
leetcode 16. 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 exactly原创 2017-06-18 16:03:06 · 258 阅读 · 0 评论 -
leetcode 29. Divide Two Integers
Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT. 解:这一题首先考虑一般情况,在不适用除法,乘法以及模运算的情况下进行整数的除法运算。可以想象使用位移运算。使用Leetcode上的讲解,假设15除以3,由于15大于原创 2017-08-15 19:15:59 · 392 阅读 · 0 评论