Leetcode
文章平均质量分 62
和风雨
这个作者很懒,什么都没留下…
展开
-
Leetcode 02 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-10-08 21:25:50 · 297 阅读 · 0 评论 -
Leetcode 08 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原创 2016-10-14 11:05:35 · 319 阅读 · 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. /*【罗马数字】 1~9: {"I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"}; 10~90: {"X",原创 2016-10-22 19:43:13 · 228 阅读 · 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. 【罗马数字】 1~9: {"I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"}; 10~90: {"X", "XX原创 2016-10-22 19:17:48 · 234 阅读 · 0 评论 -
Leetcode 09 Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space. 判断一个整数是否回文,不要使用额外的空间。 public class Solution { public boolean isPalindrome(int x) { if (x < 0) return原创 2016-10-22 17:17:57 · 226 阅读 · 0 评论 -
Leetcode 14 Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings. 方法一:LCP(S1…Sn)=LCP(LCP(LCP(S1,S2),S3),…Sn) 第一种 public class Solution { public String l原创 2016-10-22 20:32:15 · 236 阅读 · 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. For example, given array S = [-1, 0, 1,原创 2016-09-30 11:05:53 · 232 阅读 · 0 评论 -
Leetcode 06 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 N A P L S I I G原创 2016-10-12 20:59:08 · 319 阅读 · 0 评论 -
Leetcode 07 Reverse Integer
Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 分析:题目要求就是将整数进行翻转,是非常简单的。 public class Solution { public int reverse(int x) { int sign = x<0?-1:原创 2016-10-14 10:57:59 · 264 阅读 · 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 line i is at (i, ai) and (i, 0). Find原创 2016-09-30 10:50:35 · 266 阅读 · 0 评论 -
Leetcode 01 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:原创 2016-09-24 22:50:19 · 271 阅读 · 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 ha原创 2016-10-29 18:07:06 · 264 阅读 · 0 评论