Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2002
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2002

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Pattern Matching in Lists

  • To: mathgroup at smc.vnet.net
  • Subject: [mg35582] Re: Pattern Matching in Lists
  • From: Mark Westwood <MarkCWestwood at compuserve.com>
  • Date: Fri, 19 Jul 2002 06:09:50 -0400 (EDT)
  • References: <ah5qce$59o$1@smc.vnet.net>
  • Sender: owner-wri-mathgroup at wolfram.com

Anthony

It's not elegant but the following seems to solve your immediate
problem:

Count[Partition[w, 2, 1], {1, 0}]

Like you, I think that there must be a neater solution using Count, but
it's a bit early here for me to figure it out.

Regards
Mark Westwood

Anthony Mendes wrote:
> 
> Hello,
> 
> Suppose w={1,1,1,0,0,1,0,1,0,0,1,0,0}.
> 
> How can I count the number of occurrences of a 1 in w immediately
> followed by a 0 in w?
> 
> I have tried every incarnation of Count[] I can think of; for example,
> 
> Count[w,{___,1,0,___}]
> 
> does not seem to work.  In general, how can I count the number of
> occurrences of a 1 followed by a 0 in a list of 1's and 0's?  Thank you!
> 
> --
> Tony
> _____________________
> amendes at math.ucsd.edu


  • Prev by Date: Re: Pattern Matching in Lists
  • Next by Date: RE: Pattern Matching in Lists
  • Previous by thread: Re: Pattern Matching in Lists
  • Next by thread: RE: Pattern Matching in Lists