Re: number of switches
- To: mathgroup at smc.vnet.net
- Subject: [mg47508] Re: number of switches
- From: Jens-Peer Kuska <kuska at informatik.uni-leipzig.de>
- Date: Thu, 15 Apr 2004 03:39:11 -0400 (EDT)
- Organization: Universitaet Leipzig
- References: <c5j6vd$qqo$1@smc.vnet.net>
- Reply-to: kuska at informatik.uni-leipzig.de
- Sender: owner-wri-mathgroup at wolfram.com
Hi,
SwitchCount[lst_] := Length[Partition[lst, 2, 1] /. {a_, a_} :>
Sequence[]]
SwitchCount /@ {{1, 1, 0, 1}, {1, 1, 0, 0}, {1, 0, 1, 0, 1}}
Regards
Jens
fake wrote:
>
> Consider the lists {1,1,0,1} and {1,1,0,0},{1,0,1,0,1}.
> The first sequence (1101) switches 2 times (#2digit~#3digit,
> #3digit~#4digit}, the second (1100) 1 time, the third 10101 4 times.
>
> I have the following problem.
> Consider a list of binary digits. Which is the easiest way to count the
> number of switches of the list (using Mathematica commands)?