Bash 解法, 执行用时: 4ms, 内存消耗: 420KB, 提交时间: 2021-11-26

declare -A map
while read line
    do
        tmp=($line)
        [ ${tmp[0]} == "tcp" ] && ((map["${tmp[5]}"]++))
    done < nowcoder.txt
tmp=()
for ve in ${map[*]}
    do
        tmp[${#tmp[*]}]=$ve
    done
q=${#tmp[*]}
for ((i=0;i<$q;i++))
    do
        for ((j=$i+1;j<$q;j++))
            do
                if [ ${tmp[$i]} -lt ${tmp[$j]} ];then
                    t=${tmp[$i]}
                    tmp[$i]=${tmp[$j]}
                    tmp[$j]=$t
                fi
            done
    done
for ((i=0; i<q; i++))
    do
        for ve in ${!map[*]}
            do
                if [ ${tmp[$i]} -eq ${map[$ve]} ];then
                    printf "$ve ${map[$ve]}\n"
                fi
            done
    done

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

#!/bin/bash
#!/bin/awk
declare -A map
while read line
    do
        tmp=($line)
        [ ${tmp[0]} == "tcp" ] && ((map["${tmp[5]}"]++))
    done<nowcoder.txt
tmp=()
for ve in ${map[*]}
    do
        tmp[${#tmp[*]}]=$ve
    done
q=${#tmp[*]}
for ((i=0;i<$q;i++))
    do
        for ((j=$i+1;j<$q;j++))
            do
                if [ ${tmp[$i]} -lt ${tmp[$j]} ]
                then
                    t=${tmp[$i]}
                    tmp[$i]=${tmp[$j]}
                    tmp[$j]=$t
                fi
            done
    done
for ((i=0; i<q; i++))
    do
        for ve in ${!map[*]}
            do
                if [ ${tmp[$i]} -eq ${map[$ve]} ]
                then
                    printf "$ve ${map[$ve]}\n"
                fi
            done
    done

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

#!/bin/bash

declare -A map

while read -a line
do
    if [ "x${line[5]}" = "xESTABLISHED" ]
    then
        ((map[${line[5]}]++))
    elif [ "x${line[5]}" = "xTIME_WAIT" ]
    then
        ((map[${line[5]}]++))
    elif [ "x${line[5]}" = "xLISTEN" ]
    then
        ((map[${line[5]}]++))
    else
        ((map[other]++))
    fi
done < nowcoder.txt

echo "ESTABLISHED ${map[ESTABLISHED]}"
echo "TIME_WAIT ${map[TIME_WAIT]}"
echo "LISTEN ${map[LISTEN]}"

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

#! /usr/bin/env bash

########################################################
#
#
########################################################
function solution_1() {
    grep "tcp" nowcoder.txt | awk '{print $6}' | sort | uniq -c | awk '{print $2,$1}' | sort -nr -k2
}

########################################################
#
#
########################################################
function solution_2() {
    awk '{
        if($1 = /tcp/) a[$6]++
    } END {
        for(k in a) {
           print k,a[k]
       }
    }' nowcoder.txt | sort -nrk2
}

########################################################
#
#
########################################################
function solution_3() {
    local condition_index=${1}
    local target_index=${2}

    declare -A map
    local array=""
    while read line; do
        array=(${line})
        [[ ${array[${condition_index}]} = "tcp" ]] && ((map["${array[${target_index}]}"]++))
    done < nowcoder.txt

    local tmp=(${map[@]})
    local size=${#tmp[@]}
    local int=0
    for (( i = 0; i < ${size}; i++ )); do
        for (( j = $i + 1; j < ${size}; j++ )); do
            [[ ${tmp[$i]} -ge ${tmp[$j]} ]] && continue
            int=${tmp[$i]}
            tmp[i]=${tmp[$j]}
            tmp[$j]=$int
        done
    done

    for (( i = 0; i < size; i++ )); do
        for va in ${!map[*]}; do
            [[ ${tmp[$i]} = ${map[$va]} ]] && printf "$va ${map[$va]}\n"
        done
    done
}

solution_3 0 5

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

declare -A map
while read line
    do
        tmp=($line)
        [ ${tmp[0]} == "tcp" ] && ((map["${tmp[5]}"]++))
    done < nowcoder.txt
function InsertSort(){
    tmp=()
    for ve in ${map[*]}
        do
            tmp[${#tmp[*]}]=$ve
        done
    q=${#tmp[*]}
    for ((i=0;i<$q;i++))
        do
            for ((j=$i+1;j<$q;j++))
                do
                    if [ ${tmp[$i]} -lt ${tmp[$j]} ];then
                        t=${tmp[$i]}
                        tmp[$i]=${tmp[$j]}
                        tmp[$j]=$t
                    fi
                done
        done
}
InsertSort
for ((i=0; i<q; i++))
    do
        for ve in ${!map[*]}
            do
                if [ ${tmp[$i]} -eq ${map[$ve]} ];then
                    printf "$ve ${map[$ve]}\n"
                fi
            done
    done