목록leetcode풀기 (8)

소프트웨어에 대한 모든 것

LeetCode 풀기 - 260. Single Number III

260. Single Number III https://leetcode.com/problems/single-number-iii/ Single Number 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) HashMap or HashSet 자료구조를 통해서 중복을 제거하고 single number만 남겨서 문제를 해결한다. 아래 코드에서는 HashMap 사용. 시간 복잡도 : O(N) 공간 복잡도 : O(N) class Solutio..
알고리즘/LeetCode 2021. 11. 9. 05:54
LeetCode 풀기 - 1732. Find the Highest Altitude

1732. Find the Highest Altitude https://leetcode.com/problems/find-the-highest-altitude/ Find the Highest Altitude - 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) class Solution: def largestAltitude(self, gain: List[int]) -> int: # The biker starts his trip on point 0 a..
알고리즘/LeetCode 2021. 11. 9. 05:14
LeetCode 풀기 - 1877. Minimize Maximum Pair Sum in Array

1877. Minimize Maximum Pair Sum in Array https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/ Minimize Maximum Pair Sum in 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) 오름차순 정렬 후 최소, 최대 pair를 계속 구해나가서 max를 구한다. class Solution: def minPairSum(self, n..
알고리즘/LeetCode 2021. 11. 6. 23:28
LeetCode 풀기 - 1464. Maximum Product of Two Elements in an Array

1464. Maximum Product of Two Elements in an Array https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/ Maximum Product of Two Elements in an 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) O(nlogn) class Solution: def maxProduct(self, nums: L..
알고리즘/LeetCode 2021. 11. 6. 10:10
LeetCode 풀기 - 1816. Truncate Sentence

1816. Truncate Sentence https://leetcode.com/problems/truncate-sentence/ Truncate Sentence - 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) class Solution: def truncateSentence(self, s: str, k: int) -> str: return ' '.join(s.split()[:k])
알고리즘/LeetCode 2021. 11. 5. 20:04
LeetCode 풀기 - 1913. Maximum Product Difference Between Two Pairs

1913. Maximum Product Difference Between Two Pairs https://leetcode.com/problems/maximum-product-difference-between-two-pairs/ Maximum Product Difference Between Two Pairs - 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) 시간 복잡도 : O(nlogn) 공간 복잡도 : O(1) class Solution: de..
알고리즘/LeetCode 2021. 11. 5. 19:59
LeetCode 풀기 - 771. Jewels and Stones

771. Jewels and Stones 문제) You're given strings jewels representing the types of stones that are jewels, and stones representing the stones you have. Each character in stones is a type of stone you have. You want to know how many of the stones you have are also jewels. Letters are case sensitive, so "a" is considered a different type of stone from "A". 솔루션1) class Solution: def numJewelsInStones..
알고리즘/LeetCode 2021. 10. 29. 09:43
LeetCode 풀기 - 461. Hamming Distance

461. Hamming Distance 문제) 솔루션1) xor 연산을 취한 후 비트연산 class Solution: def hammingDistance(self, x: int, y: int) -> int: xor = x ^ y return sum((xor>>i & 1) for i in range(31)) 솔루션2) xor 연산을 취한 후 내장함수 bin()을 사용해서 이진수 문자열로 변환 후 1을 셈 class Solution: def hammingDistance(self, x: int, y: int) -> int: xor = x^y return bin(xor).count('1')
알고리즘/LeetCode 2021. 10. 28. 07:16
Prev 1 Next