英文原版，在美国最popular的编程宝典：编程珠玑。 Amazon.com的编辑评论： The "pearls" in question center not only on choosing the right algorithms (like binary searches, sorting techniques, or sparse arrays) but also on showing how to solve problems effectively. Each chapter f
你有一条项链，它由 N 个随机排列的红、白和蓝色的珠子组成（3<=N<=350）。下面的例子展示了两条 N=29 时的项链： 1 2 1 2 r b b r b r r b r b b b r r b r r r w r b r w w b b r r b b b b b b r b r r b r b r r r b r r r r r r b r b r r r w Figure A Figure B r red bead b blue bead w white bead 项链
