rrojin

STEP 1. 논문 선정 읽고 싶은, 읽어야 할 논문을 선정한다. 2. 핵심 키워드 파악 Abstract과 Summary를 꼼꼼하게 읽어보고 논문의 핵심 키워드를 파악한다. 3. 가벼운 구글링 핵심 키워드와 관련된 지식이 없는 경우, 30분~1시간 정도 구글링을 하여 소재에 대한 감을 잡는다. 이때는 잘 정리된 블로그 글을 읽어도 이해가 안 될 가능성이 높다. 그러니, 포기하지 말고 소재에 대한 감을 잡는다는 느낌으로 접근한다. 4. 1st 논문 읽기 논문을 천천히 읽어나가면서 이해가 안되는 부분은 질문 메모를 작성한다. (feat. 귀여운 사과 모양 스티커) 5. 2nd 논문 읽기 논문을 아주 꼼꼼히 읽으며 리뷰 작성을 위해 단락 별 키워드를 정리한다. 혹은 핵심 부분을 별도로 표시해둔다. 해당 단계에..

문제링크 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