Ct_the_world的博客

题目链接：https://leetcode-cn.com/problems/median-of-two-sorted-arrays/submissions/ class Solution: def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float: i = 0 ...

题目链接：https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/ class Solution: def lengthOfLongestSubstring(self, s: str) -> int: if len(s) == 0: re...

暴力破解： class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: delValue = 0 for i in range(len(nums)): delValue = target - nums[i] ...