leetcode
As_June
这个作者很懒,什么都没留下…
展开
-
Longest Substring Without Repeating Characters--LeetCode
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原创 2017-09-24 15:42:40 · 216 阅读 · 0 评论 -
3Sum Closest -- LeetCode
3Sum Closest(原题链接:点击打开链接)Given an array S of n integers, find three integers inS such that the sum is closest to a given number, target. Return the sum of the three integers. You may assum原创 2017-12-17 22:43:13 · 304 阅读 · 0 评论 -
Letter Combinations of a Phone Number--LeetCode
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 th原创 2017-12-24 20:35:19 · 169 阅读 · 0 评论 -
Roman to Integer
Roman to Integer Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.Solution:一种很粗暴的解法,罗列所有可能出现的情况:class Solution {public: int原创 2017-11-26 19:07:05 · 149 阅读 · 0 评论 -
3Sum--LeetCode
3Sum(原题链接:点击打开链接)Given an array S of n integers, are there elementsa, 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 sol原创 2017-12-11 18:06:51 · 168 阅读 · 0 评论 -
Longest Common Prefix--LeetCode
Longest Common Prefix(原题链接:点击打开链接)Write a function to find the longest common prefix string amongst an array of strings.Solution:class Solution {public: string longestCommonPrefix(vector&原创 2017-12-11 17:01:28 · 213 阅读 · 0 评论 -
Integer to Roman--LeetCode
Integer to Roman(原题链接:点击打开链接)Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.Solution:class Solution {public: string i原创 2017-11-19 18:29:02 · 168 阅读 · 0 评论 -
Container With Most Water--LeetCode
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原创 2017-11-11 16:24:05 · 228 阅读 · 0 评论 -
Regular Expression Matching--LeetCode
Regular Expression Matching(原题链接:点击打开链接)Implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of the preceding element原创 2017-11-11 16:06:32 · 208 阅读 · 0 评论 -
ZigZag Conversion--LeetCode
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 legib原创 2017-10-15 16:58:27 · 230 阅读 · 0 评论 -
Longest Palindromic Substring--LeetCode
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原创 2017-10-15 15:44:28 · 165 阅读 · 0 评论 -
Palindrome Number--LeetCode
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)原创 2017-10-22 15:53:16 · 194 阅读 · 0 评论 -
String to Integer (atoi)--LeetCode
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 as原创 2017-10-29 14:02:16 · 295 阅读 · 0 评论 -
Reverse Integer--LeetCode
Reverse Integer(原题链接:点击打开链接)Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321 click to show spoilers.Have you thought about this?Here are some goo原创 2017-10-01 21:02:16 · 200 阅读 · 0 评论 -
Median of Two Sorted Arrays
Median of Two Sorted ArraysThere 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原创 2017-10-08 16:07:19 · 255 阅读 · 0 评论 -
Two Sum--LeetCode
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原创 2017-09-10 22:38:19 · 293 阅读 · 0 评论 -
Add Two Numbers--LeetCode
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原创 2017-09-17 19:53:06 · 225 阅读 · 0 评论 -
Min Cost Climbing Stairs
Min Cost Climbing Stairs--LeetCode(原题链接:点击打开链接)On a staircase, the i-th step has some non-negative costcost[i] assigned (0 indexed).Once you pay the cost, you can either climb one or two steps原创 2018-01-07 19:39:48 · 269 阅读 · 0 评论