소프트웨어에 대한 모든 것

278. First Bad Version 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) 바이너리 서치를 방법을 사용한다. # The isBadVersion API is already defined for you. # @param version, an integer # @return an integer # def isBadV..

797. All Paths From Source to Target https://leetcode.com/problems/all-paths-from-source-to-target/ All Paths From Source to Target - 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) DFS 방법을 이용해서 재귀적으로 path를 탐색한다. class Solution: def allPathsSourceTarget(self, graph: List[..

1688. Count of Matches in Tournament https://leetcode.com/problems/count-of-matches-in-tournament/ Count of Matches in Tournament - 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) 문제안에 정답이 있다. 짝수 - n/2 matches, n/2 teams advance 홀수 - (n-1) / 2 matches, (n-1)/2 + 1 teams a..

1281. Subtract the Product and Sum of Digits of an Integer https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/ Subtract the Product and Sum of Digits of an Integer - 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) 숫자를 숫자 리스트 형태로 변환한다. 숫자 리스..

1720. Decode XORed Array https://leetcode.com/problems/decode-xored-array/ Decode XORed 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) XOR은 교환법칙 결합법칙이 성립한다. 1 ^ x = 1, 좌변의 1을 제거하기 위해서 양변에 1^을 취한다 1 ^ 1 ^ x = 1 ^ 1, 0 ^ x = 0, x = 0 위 과정을 반복한다. class Solution: def..

1979. Find Greatest Common Divisor of Array https://leetcode.com/problems/find-greatest-common-divisor-of-array/ Find Greatest Common Divisor of 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) 최소, 최대 값을 구하고 최소값을 계속 감소시켜가면서 최소값, 최대값을 나눈 나머지가 0인 것을 찾는다. class Soluti..

1941. Check if All Characters Have Equal Number of Occurrences https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/ Check if All Characters Have Equal Number of Occurrences - 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) defaultdict() ..

1844. Replace All Digits with Characters https://leetcode.com/problems/replace-all-digits-with-characters/ Replace All Digits with Characters - 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) ord(), chr()에 대한 이해가 필요 ord() : character을 ascii value로 변환 chr() : integer를 char..