https://leetcode.com/problems/find-the-integer-added-to-array-i/description/
1 2 3 4 5 6 | class Solution: def addedInteger(self, nums1: List[int], nums2: List[int]) -> int: nums1.sort() nums2.sort() return nums2[0] - nums1[0] | cs |
반응형
'python-algorithm' 카테고리의 다른 글
| 백준 30979 유치원생 파댕이 돌보기 (0) | 2024.06.19 |
|---|---|
| leetcode 2000. Reverse Prefix of Word (0) | 2024.05.02 |
| leetcode 1266. Minimum Time Visiting All Points (1) | 2024.04.27 |
| leetcode 2855. Minimum Right Shifts to Sort the Array (0) | 2024.04.26 |
| leetcode 3074. Apple Redistribution into Boxes (0) | 2024.04.25 |
댓글