问获取数组中最小非负数的索引？

EN

use List::Util qw( reduce );

my $i =
   reduce { $array[$a] <= $array[$b] ? $a : $b }
      grep { $array[$_] >= 0 }
         0..$#array;

use Config     qw( %Config );
use List::Util qw( minstr );

my $i =
   unpack "x$Config{ivsize} J",
      minstr
         map { pack 'J> J', $array[$_], $_ }
            grep { $array[$_] >= 0 }
               0..$#array;

my $ix = (sort { $array[$a]) <=> $array[$b] } grep { $array[$_] >= 0 } 0..$#array)[0];

#!/usr/bin/env perl

# always use these two
use strict;
use warnings;

use feature qw( :all );

# --------------------------------------
#       Name: smallest_whole_number
#      Usage: ( $smallest, $index ) = smallest_whole_number( @array );
#    Purpose: Find the smallest whole number in an array.
# Parameters: @array -- array of integers
#    Returns: ( $smallest, $index ) unless exception.
#             ( -1, -1 ) if exception.
#
sub smallest_whole_number {
    my @array = @_;

    # check if array empty
    return ( -1, -1 ) unless @array;

    # scan for first whole number
    my $index = 0;
    while( $array[$index] < 0 ){

        # exception if no whole numbers in array
        return ( -1, -1 ) if $index >= $#array;

        $index ++;
    }

    # save first whole number found
    my $smallest = $array[$index];

    # scan the rest of the array
    for( my $i = $index + 1; $i <= $#array; $i ++ ){
        my $nbr = $array[$i];

        # skip negative numbers
        next if $nbr < 0;

        # check if current number smaller
        if( $smallest > $nbr ){
            $smallest = $nbr;
            $index    = $i;
        }
    }

    return ( $smallest, $index );
}

# --------------------------------------
# main

my @array = ('3', '4', '71', '1', '-598', '-100203');

my ( $smallest, $index ) = smallest_whole_number( @array );
say "smallest is $smallest at index $index";