字符串处理

龙牙地主天

1. echo "123&&sdfsfdsdfsf;123s9d9fsdf12315677a1" | awk '{split($0,a,"[^0-9]") ; split($0,b,"[^a-zA-Z]") ; for(i in a) A=length(A)<length(a[i])?a[i]:A ; print A ; for(j in b) B=length(B)<length(b[j])?b[j]:B ; print B}'

复制代码

boobie

# cat get_max_pattern.py

1. #!/bin/python
   
2. import re
   
3. str="123&&sdfsfdsdfsf;123s9d9fsdf12315677a1"
   
4. pattern = re.compile(r'[1-9]+')
   
5. getmumpattern = re.findall((pattern), str)
   
6. getmumpattern.sort(key=len)
   
7. print getmumpattern[-1]
   
8. pattern = re.compile(r'[a-zA-Z]+')
   
9. getstrpattern = re.findall((pattern), str)
   
10. getstrpattern.sort(key=len)
    
11. print getstrpattern[-1]

复制代码

# python get_max_pattern.py
12315677
sdfsfdsdfsf

wh7211

回复 1# blueskysee

1. echo "123&&sdfsfdsdfsf;123s9d9fsdf12315677a1"|awk '{a=patsplit($0,s,"[0-9]+");b=patsplit($0,t,"[a-z]+");for(i=1;i<=a;i++){m=length(m)<length(s[i])?s[i]:m};for(i=1;i<=b;i++){n=length(n)<length(t[i])?t[i]:n};print m,n}'

复制代码

输出：
12315677 sdfsfdsdfsf

q1208c

回复 1# blueskysee

贪婪匹配，然后算算哪个长 ？

jason680

回复 1# blueskysee

1. awk code

$ str="123&&sdfsfdsdfsf;123s9d9fsdf12315677a1"

$ echo $str | awk -f get_longer.awk
number: 12315677
string: sdfsfdsdfsf

$ cat get_longer.awk

1. function get_longer(str, pattern,   t,a,n,len,ret){
   
2.   sub("\\[","[^",pattern);
   
3.   t = split(str, a, pattern);
   
4. 
   
5.   len = 0;
   
6.   ret = "";
   
7.   for(n=1; n<=t; ++n){
   
8.     if(len < length(a[n])){
   
9.       len = length(a[n]);
   
10.       ret = a[n];
    
11.     }
    
12.   }
    
13.   return ret;
    
14. }
    
15. 
    
16. {
    
17.   print "number:", get_longer($0, "[0-9]+");
    
18.   print "string:", get_longer($0, "[a-zA-Z]+");
    
19. }

复制代码

#---------------------------------------------------------------------

2. Perl code

$ perl get_longer.pl
number: 12315677
string: sdfsfdsdfsf

$ cat get_longer.pl

1. use strict;
   
2. use warnings;
   
3. 
   
4. sub get_longer{
   
5.   my($sStr, $sPattern) = @_;
   
6.   my $sRet = "";
   
7.   my $sLen = 0;
   
8.   while($sStr =~ m/($sPattern)/g){
   
9.     if($sLen < length($1)){
   
10.       $sLen = length($1);
    
11.       $sRet = $1;
    
12.     }
    
13.   }
    
14.   return $sRet;
    
15. }
    
16. 
    
17. my $sStr = "123&&sdfsfdsdfsf;123s9d9fsdf12315677a1";
    
18. 
    
19. print "number: ", get_longer($sStr, '\d+'), "\n";
    
20. print "string: ", get_longer($sStr, '[a-zA-Z]+'), "\n";
    
21. 
    

复制代码

#---------------------------------------------------------------------

3. Python code

$ python get_longer.py
number: 12315677
string: sdfsfdsdfsf

$ cat get_longer.py

1. import os,sys,re
   
2. 
   
3. def get_longer(sStr, pattern):
   
4.   rPtn = re.compile("(" + pattern + ")")
   
5.   sRet = ""
   
6.   sLen = 0
   
7.   for s in rPtn.findall(sStr):
   
8.     if(sLen <len(s)):
   
9.       sLen = len(s)
   
10.       sRet = s
    
11.     #;
    
12.   #;
    
13.   return sRet
    
14. #;
    
15. 
    
16. sStr="123&&sdfsfdsdfsf;123s9d9fsdf12315677a1"
    
17. 
    
18. print "number:", get_longer(sStr, "\d+")
    
19. print "string:", get_longer(sStr, "[a-zA-Z]+")

复制代码

yinyuemi

回复 1# blueskysee

1. sed -nr '
   
2. # 数字最长
   
3. #s/[0-9]+/\n&\n/g;
   
4. #s/^[^0-9]+$//Mg;
   
5. 
   
6. # 字符串最长
   
7. s/[[:alpha:]]+/\n&\n/g;
   
8. s/^[^[:alpha:]]+$//Mg;
   
9. 
   
10. 
    
11. s/^\n//Mg;
    
12. s/\n$//;
    
13. h;
    
14. :a;
    
15.     :b;
    
16.     s/^([^\n])([^\n]*)\n([^\n])([^\n]*)/\2\n\4/;
    
17.     tb;
    
18.     /^\n[^\n]+/bc;
    
19.     /^[^\n]+\n|^\n\n\n/bd;
    
20.     :c;
    
21.         g;
    
22.         s/^[^\n]+\n//;
    
23.         h;
    
24.         ta;
    
25.     :d;
    
26.         g;
    
27.         s/(^[^\n]+)\n[^\n]+/\1/;
    
28.         h;
    
29.         ta;
    
30. x;
    
31. p
    
32. '

复制代码

Okelani

回复 1# blueskysee

perl longest.pl

1. #!/usr/bin/perl
   
2. use 5.010;
   
3. 
   
4. $_ = "123&&sdfsfdsdfsf;123s9d9fsdf12315677a1";
   
5. my ($num) = sort { length $b <=> length $a } /(\d+)/g;
   
6. my ($str) = sort { length $b <=> length $a } /([a-zA-Z]+)/g;
   
7. 
   
8. say "num = $num";
   
9. say "str = $str";
   

复制代码

num = 12315677
str = sdfsfdsdfsf

shell_love

# coding:utf-8
# !/bin/python

# 有个字符串str1为123&&sdfsfdsdfsf;123s9d9fsdf12315677a1
# 用 shell或者python找出其中最长匹配的连续的字符串或者数字

import re
str1 = '123&&sdfsfdsdfsf;123s9d9fsdf12315677a1'
pattern_str = re.compile('[a-zA-Z]+')
pattern_num = re.compile('[0-9]+')
pattern_str_max = re.findall(pattern_str, str1)
pattern_num_max = re.findall(pattern_num, str1)
# find the longest str

res_str = ""
for i in pattern_str_max:
    if len(i) > len(res_str):
        res_str = i

# find the longest num
res_num = ""
for j in pattern_num_max:
    if len(j) > len(res_num):
        res_num = j

print("the longest str is %s; the longest num is %s" % (res_str, res_num))
==============================================
the longest str is sdfsfdsdfsf; the longest num is 12315677