摘要: Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Example 2: AC code: std 阅读全文
posted @ 2018-09-27 22:29 Veritas_des_Liberty 阅读(167) 评论(0) 推荐(0)
摘要: 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 阅读全文
posted @ 2018-09-27 17:18 Veritas_des_Liberty 阅读(156) 评论(0) 推荐(0)
摘要: Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer 阅读全文
posted @ 2018-09-27 16:50 Veritas_des_Liberty 阅读(153) 评论(0) 推荐(0)
摘要: 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 阅读全文
posted @ 2018-09-27 16:35 Veritas_des_Liberty 阅读(166) 评论(0) 推荐(0)