weixin_52593484的博客

【代码】LeetCode（Python3）6. Z字型变换。

Question： Given a strings, returnthe longest palindromic substringins. Example1： Input: s = "babad" Output: "bab" Explanation:"aba" is also a valid answer. Example2: Input: s = "cbbd" Output: "bb" Mentality: 这道题可以用中心扩散法来解，依次判断我们子串所能达到的最...

Question： Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). Example1： Input: nums1 = [1,3], nums2 = [2]Output: 2.00000Explanation:

Question： Given a string s, find the length of the longest substring without repeating characters. Example1： Input: s = "abcabcbb"Output: 3Explanation: The answer is "abc", with the length of 3. Example2： Input: s = "bbbbb"Output: 1Explanation: The

目录 两数之和 两数相加 两数之和 Question： Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element