破博客

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

There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1:nums1 = [1, 3]nums2

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 ele

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

Determine whether an integer is a palindrome. Do this without extra space.就是回文数，非常简单，用转换为String类型的来做，速度会有点慢，不如直接取余取除运算效率高直接贴代码package Q9PalindromeNumber;import java.util.Scanner;/** * @author 单继重 * @

Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.以上是题目要求 想做这道题必须要明白罗马数字是怎么写的 阿拉伯数字 罗马数字 1 I 4 IV 5 V 9

Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.跟上一题类似，上一题是阿波罗数字转罗马数字，这题是罗马数字转阿拉伯数字，我写的思路是一样的，都是遍历字符串，比较其中一个或两个和罗马数字中是否一致，如果一致便与相应数字相加，得出结果，其中有

Write a function to find the longest common prefix string amongst an array of strings.以上就是题目要求，非常简单，找出所有字符串的最长共有前缀，那就找呗，很简单一道题package Q14LongestCommonPrefix;/** * @author 单继重 * @since 2017/11/3 10:39

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 “