From 1ac782f5070259d4784b2c7066ed2be6550c940f Mon Sep 17 00:00:00 2001 From: wisdom08 Date: Sun, 30 Mar 2025 17:08:55 +0900 Subject: [PATCH 1/5] Add solution for leetcode containsDuplicate --- contains-duplicate/wisdom08.py | 7 +++++++ 1 file changed, 7 insertions(+) create mode 100644 contains-duplicate/wisdom08.py diff --git a/contains-duplicate/wisdom08.py b/contains-duplicate/wisdom08.py new file mode 100644 index 000000000..101a4be52 --- /dev/null +++ b/contains-duplicate/wisdom08.py @@ -0,0 +1,7 @@ +class Solution(object): + def containsDuplicate(self, nums): + set_nums = set(nums) + if len(nums) == len(set_nums): + return False + else: + return True From d8620841aa3048af4ba7573712111e632926461d Mon Sep 17 00:00:00 2001 From: wisdom08 Date: Sun, 30 Mar 2025 17:53:23 +0900 Subject: [PATCH 2/5] Add solution for leetcode twoSum --- two-sum/wisdom08.py | 6 ++++++ 1 file changed, 6 insertions(+) create mode 100644 two-sum/wisdom08.py diff --git a/two-sum/wisdom08.py b/two-sum/wisdom08.py new file mode 100644 index 000000000..cda931fc3 --- /dev/null +++ b/two-sum/wisdom08.py @@ -0,0 +1,6 @@ +class Solution: + def twoSum(self, nums: List[int], target: int) -> List[int]: + for i in range(len(nums)-1): + for j in range(i+1, len(nums)): + if nums[i] + nums[j] == target: + return [i, j] From e870f9f804409e0dff78daaa0ffc7ac0427da435 Mon Sep 17 00:00:00 2001 From: wisdom08 Date: Sun, 30 Mar 2025 18:52:27 +0900 Subject: [PATCH 3/5] Add solution for leetcode twoSum-2 --- two-sum/wisdom08.py | 11 +++++++---- 1 file changed, 7 insertions(+), 4 deletions(-) diff --git a/two-sum/wisdom08.py b/two-sum/wisdom08.py index cda931fc3..5afd21f57 100644 --- a/two-sum/wisdom08.py +++ b/two-sum/wisdom08.py @@ -1,6 +1,9 @@ class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: - for i in range(len(nums)-1): - for j in range(i+1, len(nums)): - if nums[i] + nums[j] == target: - return [i, j] + dict = {} + for i, v in enumerate(nums): + diff = target - v + if diff in dict: + return [i, dict[diff]] + else: + dict[v] = i From 75c9a4ad0aa17c11fadb5d92cc11c744c54307a7 Mon Sep 17 00:00:00 2001 From: wisdom08 Date: Mon, 7 Apr 2025 00:08:46 +0900 Subject: [PATCH 4/5] Add solution for leetcode topKFrequent --- top-k-frequent-elements/wisdom08.py | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 top-k-frequent-elements/wisdom08.py diff --git a/top-k-frequent-elements/wisdom08.py b/top-k-frequent-elements/wisdom08.py new file mode 100644 index 000000000..c941799d3 --- /dev/null +++ b/top-k-frequent-elements/wisdom08.py @@ -0,0 +1,10 @@ +def topKFrequent(nums, k): + frequency = {} + for num in nums: + frequency[num] = frequency.get(num, 0) + 1 + + sorted_frequency = sorted(frequency, key=lambda num: frequency[num]) + return sorted_frequency[-k:] + + +print(topKFrequent([1, 1, 1, 2, 2, 3], 2)) From 8dd7af8dd6c87801565d4aef1c19a003d1ba9ef1 Mon Sep 17 00:00:00 2001 From: wisdom08 Date: Tue, 8 Apr 2025 23:59:24 +0900 Subject: [PATCH 5/5] Add solution for leetcode longestConsecutive --- longest-consecutive-sequence/wisdom08.py | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 longest-consecutive-sequence/wisdom08.py diff --git a/longest-consecutive-sequence/wisdom08.py b/longest-consecutive-sequence/wisdom08.py new file mode 100644 index 000000000..9b927eaab --- /dev/null +++ b/longest-consecutive-sequence/wisdom08.py @@ -0,0 +1,10 @@ +def longestConsecutive(nums): + longest = 0 + + for num in nums: + length = 1 + while num + length in nums: + length += 1 + longest = max(longest, length) + + return longest