Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,851 questions

51,772 answers

573 users

How to merge two sorted arrays without duplicates in Go

1 Answer

0 votes
package main

import (
	"fmt"
	"sort"
)

func merge(arr1, arr2 []int) []int {
	mergedSet := make(map[int]struct{})

	for _, v := range arr1 {
		mergedSet[v] = struct{}{}
	}
	for _, v := range arr2 {
		mergedSet[v] = struct{}{}
	}

	mergedArray := make([]int, 0, len(mergedSet))
	for k := range mergedSet {
		mergedArray = append(mergedArray, k)
	}

	return mergedArray
}

func main() {
	arr1 := []int{1, 2, 2, 3, 7, 7, 7, 8, 9}
	arr2 := []int{0, 0, 4, 4, 4, 5, 6, 7, 7, 8}

	mergedArray := merge(arr1, arr2)

	sort.Ints(mergedArray)

	fmt.Println(mergedArray)
}


/*
run:

[0 1 2 3 4 5 6 7 8 9]

*/

 



answered Oct 10, 2024 by avibootz

Related questions

2 answers 139 views
2 answers 102 views
1 answer 183 views
1 answer 125 views
1 answer 156 views
1 answer 166 views
1 answer 186 views
...