27 lines
474 B
Go
27 lines
474 B
Go
package plunder
|
|
|
|
import "sort"
|
|
|
|
//根据value排序
|
|
type Pair struct {
|
|
Key string
|
|
Value int
|
|
}
|
|
|
|
type PairList []Pair
|
|
|
|
func (p PairList) Swap(i, j int) { p[i], p[j] = p[j], p[i] }
|
|
func (p PairList) Len() int { return len(p) }
|
|
func (p PairList) Less(i, j int) bool { return p[i].Value < p[j].Value }
|
|
|
|
func sortMap(m map[string]int) PairList {
|
|
p := make(PairList, len(m))
|
|
i := 0
|
|
for k, v := range m {
|
|
p[i] = Pair{k, v}
|
|
i++
|
|
}
|
|
sort.Sort(p)
|
|
return p
|
|
}
|