rrojin

문제링크 https://leetcode.com/problems/reverse-words-in-a-string-iii/ Reverse Words in a String III - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 1 2 3 4 5 6 7 8 9 class Solution: def reverseWords(self, s: str) -> str: words = s.split() ans = "" for i,word in enumerate(words): a..

문제링크 https://leetcode.com/problems/reverse-string/ Reverse String - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 풀이1 1 2 3 4 5 6 7 8 9 10 11 class Solution: def reverseString(self, s: List[str]) -> None: """ Do not return anything, modify s in-place instead. """ left, right =..

문제링크 https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/ Two Sum II - Input Array Is Sorted - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 풀이1 1 2 3 4 5 6 7 8 9 10 11 12 13 class Solution: def twoSum(self, numbers: List[int], target: int) -> List[int]: n = len(num..

문제링크 https://leetcode.com/problems/move-zeroes/ Move Zeroes - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 1 2 3 4 5 6 7 class Solution: def moveZeroes(self, nums: List[int]) -> None: nonzero = 0 for i in range(len(nums)): if nums[i] != 0: nums[nonzero], nums[i] = nums[i], nu..

문제링크 https://leetcode.com/problems/rotate-array/ Rotate Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 풀이1 1 2 3 4 5 6 7 8 class Solution: def rotate(self, nums: List[int], k: int) -> None: """ Do not return anything, modify nums in-place instead. """ n = len(nums) k = ..

문제링크 https://leetcode.com/problems/squares-of-a-sorted-array/ Squares of a Sorted Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 풀이1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 class Solution: def sortedSquares(self, nums: List[int]) -> List[int]: left, right = 0, len(nums)-..

문제링크 https://leetcode.com/problems/search-insert-position/ Search Insert Position - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 class Solution: def searchInsert(self, nums: List[int], target: int) -> int: left, right = 0, len(nums)-1..

문제링크 https://leetcode.com/problems/first-bad-version/ First Bad Version - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 # The isBadVersion API is already defined for you. # def isBadVersion(version: int) -> bool: class Solution: def first..

문제링크 https://leetcode.com/problems/binary-search/ Binary Search - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 1 2 3 4 5 6 7 8 9 10 11 12 class Solution: def search(self, nums: List[int], target: int) -> int: left, right = 0, len(nums)-1 while left

문제링크 https://www.acmicpc.net/problem/14889 14889번: 스타트와 링크 예제 2의 경우에 (1, 3, 6), (2, 4, 5)로 팀을 나누면 되고, 예제 3의 경우에는 (1, 2, 4, 5), (3, 6, 7, 8)로 팀을 나누면 된다. www.acmicpc.net 코드 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 import sys input = sys.stdin.readline n = int(i..