随笔分类 - leetcode
摘要：Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: Example: class Solution {
阅读全文
摘要：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 sh
阅读全文
摘要：Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the leng
阅读全文
摘要：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 contai
阅读全文
摘要：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 ex
阅读全文
摘要：步骤一：在浏览器输入www.leetcode.com步骤二：点击右上角注册步骤三：注册登录后，点击右上角的Online judge步骤四：可能又会让你登录，点击sing in而不是sign up，输入用户名密码登录：步骤五：选个题目，然后选择语言，在代码编辑器中输入代码，然后submit solut
阅读全文
