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: [mg35568] Re: Pattern Matching in Lists
  • From: "Carl K. Woll" <carlw at u.washington.edu>
  • Date: Fri, 19 Jul 2002 06:08:35 -0400 (EDT)
  • Organization: University of Washington
  • References: <ah5qce$59o$1@smc.vnet.net>
  • Sender: owner-wri-mathgroup at wolfram.com

Hi Anthony,

Here is one possibility:

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

Carl Woll
Physics Dept
U of Washington

"Anthony Mendes" <amendes at zeno.ucsd.edu> wrote in message
news:ah5qce$59o$1 at smc.vnet.net...
> 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: Simplified Integration Problem
  • Previous by thread: Re: Pattern Matching in Lists
  • Next by thread: Re: Pattern Matching in Lists