LeetCode OJ
文章平均质量分 75
杨逸
这个作者很懒,什么都没留下…
展开
-
LeetCode OJ 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 link原创 2016-02-28 13:06:29 · 246 阅读 · 0 评论 -
LeetCode OJ 3.Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For原创 2016-02-28 13:07:38 · 206 阅读 · 0 评论 -
LeetCode OJ 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)).思路就是两个合并cla原创 2016-02-28 13:17:05 · 315 阅读 · 0 评论 -
LeetCode OJ 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原创 2016-02-28 13:19:57 · 318 阅读 · 0 评论 -
LeetCode OJ 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-02-28 13:18:03 · 251 阅读 · 0 评论 -
LeetCode OJ 7. Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -32137.52% 直接用long来转换,转换后判断是否越界。class Solution {public: int reverse (int x) {原创 2016-02-28 13:21:03 · 237 阅读 · 0 评论 -
LeetCode OJ 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 ca原创 2016-02-28 19:23:49 · 238 阅读 · 0 评论 -
LeetCode OJ9. Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.%3 分解出所有元素后放入vector,每个值中间插入一个1,这样所有的都会变成奇数个。然后从中间开始 循环判断是否符合要求class Solution {public: bool isPalindrome(int x)原创 2016-02-28 19:45:02 · 270 阅读 · 0 评论 -
LeetCode OJ 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原创 2016-02-28 12:59:49 · 197 阅读 · 0 评论