qq_38337582的博客

Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 思路 代码： package leetCode; import java.util.ArrayList; public class ReverseInteger { p

题目： 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

题目：  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

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 "