leetcode-java
带只宠物去散步
这个作者很懒,什么都没留下…
展开
-
LeetCode专栏L001_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 s原创 2017-04-28 11:02:41 · 214 阅读 · 0 评论 -
LeetCode专栏L007_Reverse_Integer
问题描述: Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321Note: The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reve原创 2017-05-11 13:13:47 · 355 阅读 · 0 评论 -
LeetCode专栏L009_Palindrome_Number
问题描述: Determine whether an integer is a palindrome. Do this without extra space.中文大意: 判断一个数是不是回文数,注意不能用额外空间。解题思路: 1.变成字符串比较。但是不能用额外空间,此处不可行。 2.反转数字后比较。参照L007_Reverse_Integer,我们知道反转后的数值可能超出范围,故不可原创 2017-05-11 17:41:55 · 208 阅读 · 0 评论 -
LeetCode专栏L013_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-3999之间。解题思路: 从前往后扫描。 res为最后的结果。记录一个pre一个cur,pre表示res已经原创 2017-05-11 20:04:07 · 247 阅读 · 0 评论 -
LeetCode专栏L020_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 val原创 2017-05-17 15:26:37 · 188 阅读 · 0 评论