堆栈问题

yestreenstars

处理前：
{0},1,2,{3,4},{{{0,1},1,2},5,6,{7,8},9,0,{1,1},{2,2,3},0,{1,{2},3}},0,{1,1},0,0,{2,2},{0}

要求：
取出括号里的各个元素。

处理后：
0
3,4
0,1
1,2
5,6,
7,8
9,0,
1,1
2,2,3
0,
1,
2
3
1,1
2,2
0

注：聪明的你应该发现有些结果后面会多出一个逗号，并非我打错了。

mcshell

1. perl -e '$str1="{0},1,2{3,4},{{{0,1},1,2},5,6,{7,8},9,0,{1,1},{2,2,3},0,{1,{2},3}},0,{1,1},0,0,{2,2},{0}"; while($str1 =~ /\{((.*?(?:([^{}]++|(?R)))*?))\}/g){$a=$1;while($a=~/([^{}]+)/g){$b=$1;$b =~ s/(^,?+)//g;next if($b=~m/^\s*(#|$)/);print "$b\n"}}'
   
2. 0
   
3. 3,4
   
4. 0,1
   
5. 1,2
   
6. 5,6,
   
7. 7,8
   
8. 9,0,
   
9. 1,1
   
10. 2,2,3
    
11. 0,
    
12. 1,
    
13. 2
    
14. 3
    
15. 1,1
    
16. 2,2
    
17. 0
    

复制代码

kernel69

能否说一下思路？回复 2# mcshell


   

mcshell

回复 3# kernel69


    这里的核心是平衡组
perlre：
PARNO is a sequence of digits (not starting with 0) whose value reflects the paren-number of the capture group to recurse to. (?R) recurses to the beginning of the whole pattern. (?0) is an alternate syntax for (?R). If PARNO is preceded by a plus or minus sign then it is assumed to be relative, with negative numbers indicating preceding capture groups and positive ones following. Thus (?-1) refers to the most recently declared group, and (?+1) indicates the next group to be declared. Note that the counting for relative recursion differs from that of relative backreferences, in that with recursion unclosed groups are included.

kernel69

英语不好的伤不起啊，不过还是要谢谢回复 4# mcshell


   

mcshell

回复 5# kernel69


    我也不好，但是一字一字的看，一遍一遍的实践，你就会明白的。perlre的确是吓退了很多人、
扯远了

blackold

try:

1. echo ....|sed '/{\([^{}]\+\)\(},\?\|{\)\(.*\)/{s//{\2\3\n\1/;s/{},\?//g;s/\(.*\)\n\(.*\)/\2\n\1/;P;D;};d'

复制代码

mcshell

回复 7# blackold


    黑哥V5

yinyuemi

1. perl -le '$str="{0},1,2,{3,4},{{{0,1},1,2},5,6,{7,8},9,0,{1,1},{2,2,3},0,{1,{2},3}},0,{1,1},0,0,{2,2},{0}";
   
2. $re1 = qr{(\{((?:(([^{}]+)|(?1)?(?4)(?1)?)))*\})};
   
3. $re2 = qr{(?:(\{|\},))([^{}]+)(?=[{}])};
   
4. while($str =~ m{$re1}g){$t=$1;while($t =~ m{$re2}g){print $2}}'

复制代码

yestreenstars

@mcshell@blackold@yinyuemi你们都很棒~如果再来一个awk版本的就完美了~我昨天搞了一天都没搞出来~