我有一个包含文字的文件:
hello mayank1 kumar mayank21
yadav Kevin has at most
K
K minutes to perform this operations. He decides mayank3 that the string is super mayank4
if it is the lexicographically
smallest among all possible strings mayank15
that he can get. Your task is to help Kevin and
find this mayank2 lexicographically mayank8 smallest string mayank9
Run Code Online (Sandbox Code Playgroud)
我怎么能找到所有mayank<number>?
我试过了:
use strict;
open( FH, "testfile.txt" ) or die "Can't open file for reading.";
while ( my $line = <FH> ) …Run Code Online (Sandbox Code Playgroud)