![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
C++
VoidShooter26
这个作者很懒,什么都没留下…
展开
-
LeetCode 学习记录 1.Two Sum
1 题目要求: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 ...原创 2018-06-10 21:20:57 · 143 阅读 · 0 评论 -
LeetCode 学习记录 15. 3Sum
1 题目要求:Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:The solution set must...原创 2018-10-27 20:45:41 · 90 阅读 · 0 评论 -
LeetCode 学习记录 13. Roman to Integer
1 题目要求:Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.Symbol ValueI 1V 5X 10L 50C 100D ...原创 2018-10-24 17:00:52 · 98 阅读 · 0 评论 -
LeetCode 学习记录 12. Integer to Roman
1 题目要求:Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.Symbol ValueI 1V 5X 10L 50C 100D ...原创 2018-10-24 15:38:00 · 87 阅读 · 0 评论 -
LeetCode 学习记录 11. Container With Most Water
1 题目要求: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)....原创 2018-10-24 14:21:51 · 127 阅读 · 0 评论 -
LeetCode 学习记录 7. Reverse Integer
1 题目要求:Given a 32-bit signed integer, reverse digits of an integer.Example 1:Input: 123Output: 321Example 2:Input: -123Output: -321Example 3:Input: 120Output: 21Note:Assume w...原创 2018-10-21 23:03:21 · 91 阅读 · 0 评论 -
LeetCode 学习记录 5. Longest Palindromic Substring
1 题目要求:Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example 1:Input: "babad"Output: "bab"Note: "aba" is also a valid answ...原创 2018-10-21 16:11:43 · 103 阅读 · 0 评论 -
LeetCode 学习记录 14. Longgest Common Prefix
1 题目要求:Write a function to find the longest common prefix string amongst an array of strings.If there is no common prefix, return an empty string "".Example 1:Input: ["flower","flow","flight"...原创 2018-10-25 17:54:52 · 139 阅读 · 0 评论 -
LeetCode 学习记录 17. Letter Combinations of aPhone Number
1 题目要求:Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone button...原创 2018-10-28 15:44:35 · 138 阅读 · 0 评论 -
LeetCode 学习记录 9. Palindrome Number
1 题目要求:Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.Example 1:Input: 121Output: trueExample 2:Input: -121Output: f...原创 2018-10-22 20:59:04 · 86 阅读 · 0 评论 -
LeetCode 学习记录 6. ZigZag Conversion
1 题目要求: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 ...原创 2018-10-21 22:10:41 · 86 阅读 · 0 评论 -
LeetCode 学习记录 8. String to Integer(atoi)
1 题目要求:Implement atoi which converts a string to an integer.The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting...原创 2018-10-22 18:03:42 · 84 阅读 · 0 评论 -
LeetCode 学习记录 3. Longest Substring Without Repeating Characters
1 题目要求:Given a string, find the length of the longest substring without repeating characters.Example 1:Input: "abcabcbb"Output: 3 Explanation: The answer is "abc", with the length of 3. Ex...原创 2018-09-27 21:57:14 · 141 阅读 · 1 评论 -
LeetCode 学习记录 2.Add Two Numbers
1 题目要求: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...原创 2018-07-12 16:43:57 · 128 阅读 · 0 评论 -
LeetCode 学习记录 16. 3Sum Closest
1 题目要求:Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each inp...原创 2018-10-27 22:28:48 · 96 阅读 · 0 评论