排序Map键值对

//将Map键值对按值降序排序,返回指定个键值对
static def sortor(map, resultLength) {
    def resultList = []
    if (!map.isEmpty()) {
        def  vals = map.values().toArray()
        def  keys = map.keySet().toArray()
        for (int i=0; i < (vals.size() - 1); i++) {
            for (int j=(i + 1); j < vals.size(); j++) {
                if (vals[i] < vals[j]) {
                    //值按降序排序
                    def tempValue = vals[i]
                    vals[i] = vals[j]
                    vals[j] = tempValue
                    //键和值同步排序
                    def tempKey = keys[i]
                    keys[i] = keys[j]
                    keys[j] = tempKey
                }
            }
        }
        def resultKeys = []
        def resultVals = []
        for (int i=0; i < vals.size(); i++) {
            resultKeys << keys[i]
            resultVals << vals[i]
        }
        if (resultLength > vals.size()) {
            resultList << resultKeys
            resultList << resultVals
        } else {
            resultList << resultKeys.subList(0,resultLength)
            resultList << resultVals.subList(0,resultLength)
        }
    }
    return resultList
}

评论

2 楼 chenfeng0104 2010-09-17  

这里是手动实现，当然如果用sort()方法就不需要我们考虑实现方法，仅仅给一个比较就行

1 楼 lcwen_08 2010-09-16  

你想得太复杂了