刷题
syldt
这个作者很懒,什么都没留下…
展开
-
07翻转整数
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321思路代码:package leetCode;import java.util.ArrayList;public class ReverseInteger {p原创 2017-09-23 16:19:34 · 235 阅读 · 0 评论 -
01刷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.Example: Given转载 2017-09-18 17:45:55 · 340 阅读 · 0 评论 -
20刷LeetCode
题目: Given a string containing just the characters , determine if the input string is valid.The brackets must close in the correct order, “()” and “()[]{}” are all valid but “(]” and “([)]” are n转载 2017-09-27 20:37:28 · 173 阅读 · 0 评论 -
03刷LeetCode
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 "转载 2017-09-21 11:20:56 · 194 阅读 · 0 评论