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,872 questions

51,796 answers

573 users

How to merge overlapping ranges (start,end),(start,end) in Go

1 Answer

0 votes
package main

import (
    "fmt"
    "sort"
)

type Range [2]int

func mergeRanges(ranges []Range) []Range {
    // Sort by start value
    sort.Slice(ranges, func(i, j int) bool {
        return ranges[i][0] < ranges[j][0]
    })

    var merged []Range

    for _, r := range ranges {
        start, end := r[0], r[1]

        if len(merged) == 0 || start > merged[len(merged)-1][1] {
            merged = append(merged, Range{start, end})
        } else {
            last := &merged[len(merged)-1]
            if end > last[1] {
                last[1] = end
            }
        }
    }

    return merged
}

func main() {
    ranges := []Range{
        {302, 447},
        {488, 489},
        {121, 234},
        {200, 421},
        {140, 354},
    }

    fmt.Println(mergeRanges(ranges))
}


/*
run:

[[121 447] [488 489]]

*/

 



answered Jan 26 by avibootz
...