brett427的博客

Given a string, find the length of the longest substring without repeating characters.Example 1:Input: “abcabcbb”Output: 3Explanation: The answer is “abc”, with the length of 3.Example 2:Input: ...

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 i...

class Solution { public int[] twoSum(int[] nums, int target) { Map<Integer,Integer> map =new HashMap<Integer,Integer>(); for(int i=0;i<nums.length;i++) { ...