From 17095ea3b2d6384c8109218208fc16fa9c81dfa6 Mon Sep 17 00:00:00 2001 From: Matej Focko Date: Thu, 23 May 2024 20:48:26 +0200 Subject: [PATCH] go: remove unused parameter Task: The Number of Beautiful Subsets Signed-off-by: Matej Focko --- go/the-number-of-beautiful-subsets.go | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/go/the-number-of-beautiful-subsets.go b/go/the-number-of-beautiful-subsets.go index 1ef7534..df87890 100644 --- a/go/the-number-of-beautiful-subsets.go +++ b/go/the-number-of-beautiful-subsets.go @@ -7,20 +7,20 @@ import ( func beautifulSubsets(nums []int, k int) int { seen := make(map[int]int) - var dfs func(int, int) int - dfs = func(lastNum, i int) int { + var dfs func(int) int + dfs = func(i int) int { // BASE: Got to the end of the slice if i >= len(nums) { return 1 } // Initialize with skipping the current number - foundSubsets := dfs(lastNum, i+1) + foundSubsets := dfs(i + 1) // Check if we can include the current number if seen[nums[i]-k] == 0 && seen[nums[i]+k] == 0 { seen[nums[i]] += 1 - foundSubsets += dfs(nums[i], i+1) + foundSubsets += dfs(i + 1) seen[nums[i]] -= 1 } @@ -28,5 +28,5 @@ func beautifulSubsets(nums []int, k int) int { } slices.Sort(nums) - return dfs(nums[0]-k-1, 0) - 1 + return dfs(0) - 1 }