CODEWITHSUNDEEP
gomaps
Neha
Neha

Reputation: 3650

Traverse a Map in decreasing order of values

I'm trying to traverse a map in decreasing order of the values stored against keys. I've tried:

func frequencySort(s string) string {
  var frequency map[string]int
  chararray := strings.Split(s , "")
  var a []int
  var arranged map[int]string
  for k , v := range frequency {
      arranged[v] = k
  }
  for k := range arranged {
      a = append(a , k)
  }
  sort.Sort(sort.Reverse(sort.IntSlice{a}))
}

Let's say the Map structure is :

    "a" : 9
    "b" : 7
    "c" : 19
    "d" : 11

and I'm trying to traverse it such that the output is :

"c" : 19
"d" : 11
"a" : 9
"b" : 7

Upvotes: 3

Views: 3478

Answers (2)

peterSO
peterSO

Reputation: 166614

For example,

package main

import (
    "fmt"
    "sort"
)

type frequncy struct {
    c string
    f int
}

func frequencies(s string) []frequncy {
    m := make(map[string]int)
    for _, r := range s {
        m[string(r)]++
    }
    a := make([]frequncy, 0, len(m))
    for c, f := range m {
        a = append(a, frequncy{c: c, f: f})
    }
    sort.Slice(a, func(i, j int) bool { return a[i].f > a[j].f })
    return a
}

func main() {
    s := "aaaaabcbcbcbzxyyxzzsoaz"
    fmt.Println(s)
    f := frequencies(s)
    fmt.Println(f)
}

Playground: https://play.golang.org/p/d9i3yL1x4K

Output:

aaaaabcbcbcbzxyyxzzsoaz
[{a 6} {b 4} {z 4} {c 3} {x 2} {y 2} {s 1} {o 1}]

Upvotes: 2

mkopriva
mkopriva

Reputation: 38268

The two map approach you have in your example will break as soon as you have more than one key in frequency with the same value, say "a":7 and "b":7, then you would lose data in arranged since keys have to be unique.

To avoid this you could create a helper type that will hold the map's contents temporarily, just for sorting purposes. Something like this:

package main

import (
    "fmt"
    "sort"
)

var m = map[string]int{
    "a": 9,
    "b": 7,
    "c": 19,
    "d": 11,
}

type entry  struct {
    val int
    key string
}

type entries []entry

func (s entries) Len() int { return len(s) }
func (s entries) Less(i, j int) bool { return s[i].val < s[j].val }
func (s entries) Swap(i, j int) { s[i], s[j] = s[j], s[i] }

func main() {
    var es entries
    for k, v := range m {
        es = append(es, entry{val: v, key: k})
    }

    sort.Sort(sort.Reverse(es))

    for _, e := range es {
        fmt.Printf("%q : %d\n", e.key, e.val)   
    }
}

https://play.golang.org/p/TPb0zNCtXO

Upvotes: 2

Related Questions