leetcode
esllovewyForever
这个作者很懒,什么都没留下…
展开
-
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. Add the two numbers and return it转载 2017-12-23 15:51:50 · 156 阅读 · 0 评论 -
Length of Last Word
Given a string s consists of upper/lower-case alphabets and empty space characters ’ ‘, return the length of last word in the string.If the last word does not exist, return 0.Note: A word is defined as转载 2017-12-23 11:14:18 · 138 阅读 · 0 评论 -
Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] has the原创 2017-12-23 10:56:25 · 177 阅读 · 0 评论 -
Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.Examp原创 2017-12-23 09:37:09 · 148 阅读 · 0 评论 -
Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 将两个已经排好序的链表合并成一个有序链表/** * Definition for singly-linked li转载 2017-12-21 11:50:21 · 195 阅读 · 0 评论 -
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 valid but “转载 2017-12-21 10:53:15 · 153 阅读 · 0 评论 -
Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999. 讲一个输入的罗马数字变成相应的整数。 首先要知道每一个罗马数字代表与组成含义。public int romanInput(String s){ int nums[] =原创 2017-12-20 17:57:41 · 135 阅读 · 0 评论 -
Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings. 就是找一个字符串数组的公共最长前缀。先上代码 public static String longestCommonPrefix(String[] strs) { if(strs.length==0){原创 2017-12-20 17:54:58 · 216 阅读 · 0 评论 -
Determine whether an integer is a palindrome. Do this without extra space.
Some hints: Could negative integers be palindromes? (ie, -1)If you are thinking of converting the integer to string, note the restriction of using extra space.You could also try reversing an integer.原创 2017-11-22 17:40:23 · 312 阅读 · 0 评论 -
Reverse Integer
Given a 32-bit signed integer, reverse digits of an integer. Example 1:Input: 123 Output: 321 Example 2:Input: -123 Output: -321 Example 3:Input: 120 Output: 21 Note: Assume we are dealing wit转载 2017-11-22 10:58:59 · 191 阅读 · 0 评论 -
LeetCode第一题
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 same element twice.转载 2017-11-20 16:39:45 · 270 阅读 · 0 评论 -
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”, which the length is 3.Given “bbbbb”, the answer is “b”, with the le转载 2017-12-24 09:33:14 · 156 阅读 · 0 评论