the faster way to find repeated sublists
- To: mathgroup at smc.vnet.net
- Subject: [mg60923] the faster way to find repeated sublists
- From: "giampiero" <giampiero196019 at yahoo.it>
- Date: Tue, 4 Oct 2005 01:24:52 -0400 (EDT)
- Sender: owner-wri-mathgroup at wolfram.com
i'm newbie
with a stupid problem
a function for find repetead sublist in faster way
ex
f[{1,2,1,2,1,2},{1,2}]-> True cause {1,2} is repated three times
f[{1,2,3,1,2,3},{1,2,3}]-> True cause {1,2,3} is repeated two times
f[{1,2,1,2,3},{1,2}]->False cause after two {1,2} there is another
symbol.
True if the second list in containes many times exactly in first list
False otherwise.
bye everyone and sorry for my stupidity.
giampiero
- Follow-Ups:
- Re: the faster way to find repeated sublists
- From: Pratik Desai <pdesai1@umbc.edu>
- Re: the faster way to find repeated sublists
- From: János <janos.lobb@yale.edu>
- Re: the faster way to find repeated sublists
- From: Andrzej Kozlowski <akoz@mimuw.edu.pl>
- Re: the faster way to find repeated sublists