Bash 解法, 执行用时: 3ms, 内存消耗: 428KB, 提交时间: 2021-12-04

declare -A map
while read line
    do
        tmp=($line)
        [[ ${tmp[3]} =~ 23/Apr ]] && ((map["${tmp[0]}"]++))
    done < nowcoder.txt
function ShellSort(){    #希尔排序
    tmp=()
    for ve in ${map[*]}
        do
            tmp[${#tmp[*]}]=$ve
        done
    q=${#tmp[*]}
for (( gap=q>>1; gap>0; gap=gap>>1 ))
    do
        for (( i=gap; i<q; i++ ))
            do
                temp=${tmp[$i]}
                for (( a=i-gap; a>=0&temp>${tmp[$a]}; a-=gap ))
                    do
                        tmp[$a+$gap]=${tmp[$a]}
                    done
                tmp[$a+$gap]=$temp
            done
    done
}
ShellSort
for ((i=0; i<$q; i++))
    do
        for ve in ${!map[*]}
            do
                if [ ${tmp[$i]} -eq ${map[$ve]} ];then
                    printf "${map[$ve]} $ve\n"
                fi
            done
    done

Bash 解法, 执行用时: 4ms, 内存消耗: 420KB, 提交时间: 2022-04-13

#!/bin/bash
#!/bin/awk
declare -A map
while read line
    do
        tmp=($line)
        [[ ${tmp[3]} =~ 23/Apr ]] && ((map["${tmp[0]}"]++))
    done < nowcoder.txt
function ShellSort(){
    tmp=()
    for ve in ${map[*]}
        do
            tmp[${#tmp[*]}]=$ve
        done
    q=${#tmp[*]}
for (( gap=q>>1; gap>0; gap=gap>>1 ))
    do
        for (( i=gap; i<q; i++ ))
            do
                temp=${tmp[$i]}
                for (( a=i-gap; a>=0&temp>${tmp[$a]}; a-=gap ))
                    do
                        tmp[$a+$gap]=${tmp[$a]}
                    done
                tmp[$a+$gap]=$temp
            done
    done
}
ShellSort
for ((i=0; i<$q; i++))
    do
        for ve in ${!map[*]}
            do
                if [ ${tmp[$i]} -eq ${map[$ve]} ];then
                    printf "${map[$ve]} $ve\n"
                fi
            done
    done

Bash 解法, 执行用时: 4ms, 内存消耗: 512KB, 提交时间: 2021-12-20

declare -A map
while read line
    do
        tmp=($line)
        [[ ${tmp[3]} =~ 23/Apr ]] && ((map["${tmp[0]}"]++))
    done < nowcoder.txt
function ShellSort(){
    tmp=()
    for ve in ${map[*]}	#map的值转到tmp数组里
        do
            tmp[${#tmp[*]}]=$ve
        done
    q=${#tmp[*]}
	for (( gap=q>>1; gap>0; gap=gap>>1 )) #希尔排序，对tmp数组进行排序
	    do
	        for (( i=gap; i<q; i++ ))
	            do
	                temp=${tmp[$i]}
	                for (( a=i-gap; a>=0&temp>${tmp[$a]}; a-=gap ))
	                    do
	                        tmp[$a+$gap]=${tmp[$a]}
	                    done
	                tmp[$a+$gap]=$temp
	            done
	    done
}
ShellSort
for ((i=0; i<$q; i++))
    do
        for ve in ${!map[*]}
            do
                if [ ${tmp[$i]} -eq ${map[$ve]} ];then
                    printf "${map[$ve]} $ve\n"
                fi
            done
    done

Bash 解法, 执行用时: 4ms, 内存消耗: 552KB, 提交时间: 2022-01-21

declare -A map
while read line
    do
        tmp=($line)
        [[ ${tmp[3]} =~ 23/Apr ]] && ((map["${tmp[0]}"]++))
    done < nowcoder.txt
function ShellSort(){
    tmp=()
    for ve in ${map[*]}  #map的值转到tmp数组里
        do
            tmp[${#tmp[*]}]=$ve
        done
    q=${#tmp[*]}
    for (( gap=q>>1; gap>0; gap=gap>>1 )) #希尔排序，对tmp数组进行排序
        do
            for (( i=gap; i<q; i++ ))
                do
                    temp=${tmp[$i]}
                    for (( a=i-gap; a>=0&temp>${tmp[$a]}; a-=gap ))
                        do
                            tmp[$a+$gap]=${tmp[$a]}
                        done
                    tmp[$a+$gap]=$temp
                done
        done
}
ShellSort
for ((i=0; i<$q; i++))
    do
        for ve in ${!map[*]}
            do
                if [ ${tmp[$i]} -eq ${map[$ve]} ];then
                    printf "${map[$ve]} $ve\n"
                fi
            done
    done

Bash 解法, 执行用时: 5ms, 内存消耗: 1248KB, 提交时间: 2021-11-27

awk '{
    if(substr($4, 2, 11) == "23/Apr/2020") res[$1]++;
}END{
    for(k in res){
        print res[k] " " k
    }
}' | sort -nr -k1