feat: 2670. Find the Distinct Difference Array

leetcode/2670/2670. Find the Distinct Difference Array.go

@@ -0,0 +1,24 @@
+package _670
+
+func distinctDifferenceArray(nums []int) []int {
+	n := len(nums)
+	diff := make([]int, n)
+	prefixSet := make(map[int]bool)
+	suffixSet := make(map[int]int)
+
+	// Initialize suffix set with counts
+	for _, num := range nums {
+		suffixSet[num]++
+	}
+
+	for i, num := range nums {
+		prefixSet[num] = true
+		suffixSet[num]--
+		if suffixSet[num] == 0 {
+			delete(suffixSet, num)
+		}
+
+		diff[i] = len(prefixSet) - len(suffixSet)
+	}
+	return diff
+}

leetcode/2670/2670. Find the Distinct Difference Array_test.go

@@ -0,0 +1,32 @@
+package _670
+
+import (
+	"reflect"
+	"testing"
+)
+
+func Test_distinctDifferenceArray(t *testing.T) {
+	type args struct {
+		nums []int
+	}
+	tests := []struct {
+		name string
+		args args
+		want []int
+	}{
+		{
+			name: "one",
+			args: args{
+				nums: []int{1, 2, 3, 4, 5},
+			},
+			want: []int{-3, -1, 1, 3, 5},
+		},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := distinctDifferenceArray(tt.args.nums); !reflect.DeepEqual(got, tt.want) {
+				t.Errorf("distinctDifferenceArray() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}