leetcode10 [코딩 테스트] 리트코드 4 - Median of Two Sorted Arrays (Hard) in Python 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)). 두 정렬된 배열들 num1와 nums2가 주어질 때, 둘의 median 값을 리턴하라. Example 1: Input: nums1 = [1,3], nums2 = [2] Output: 2.00000 Explanation: merged array = [1,2,3] and median is 2. Example 2: Input: nums1 = [1,2], nums2 = [3,4] Output: 2.50000 Ex.. 2021. 5. 22. [코딩 테스트] 리트코드 3 - Longest Substring without Repeating Characters (Medium) in Python Given a string s, find the length of the longest substring without repeating characters 문자열 s가 주어졌을 때, 반복되지 않는 문자로 이뤄진 가장 긴 부분문자열의 길이를 리턴하세요! Example 1: Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3. Example 2: Input: s = "bbbbb" Output: 1 Explanation: The answer is "b", with the length of 1. Example 3: Input: s = "pwwkew" Output: 3 Explanation: The answe.. 2021. 5. 22. [코딩 테스트] 리트코드 2 - Add Two Numbers (Medium) in Python 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 contains a single digit. Add the two numbers and return the sum as a linked list. You may assume the two numbers do not contain any leading zero, except the number 0 itself 두 정수 (> 0)가 연결리스트의 형태로 주어졌을 때, 두 정수를 더한 값을 연결리스트의 형태로 리턴하세요. 다만 연결리스트는 각 자리수가 역순.. 2021. 5. 22. [코딩 테스트] 리트코드 1 - Two Sum (Easy) in Python 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 twice. 2 List[int]: hashTable = {} for i in range(len(nums)): complement = target - nums[i] if complement in hashTable: return [i, hashTable[complement]] hashTable[nums[i]] = .. 2021. 5. 22. 이전 1 2 3 다음
