From ec4f6a11102f9419eeaa36042fa265a95bf5e4e2 Mon Sep 17 00:00:00 2001 From: Ritik2604 <49342895+Ritik2604@users.noreply.github.com> Date: Mon, 25 May 2020 03:17:26 +0530 Subject: [PATCH] Update CountNumBinaryStrings --- DynamicProgramming/CountNumBinaryStrings | 28 ++++++++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git a/DynamicProgramming/CountNumBinaryStrings b/DynamicProgramming/CountNumBinaryStrings index c71fbd63c..3dd0bf7de 100644 --- a/DynamicProgramming/CountNumBinaryStrings +++ b/DynamicProgramming/CountNumBinaryStrings @@ -1,3 +1,31 @@ +package DynamicProgramming; +/* +* here is a important algo in this we have to count +* maximum no. of different binary strings which doesnot have +* consectuive 1s + + + +Test Case: + +int n=30; + + startAlgo(); + System.out.println(numStrIS(n)); + System.out.println(endAlgo()+"ms"); + + startAlgo(); + CountNumBinaryStr out=new CountNumBinaryStr(); + System.out.println(out.numStrR(n).ans); + System.out.println(endAlgo()+"ms"); + + startAlgo(); + System.out.println(countStrings(n,0)); + System.out.println(endAlgo()+"ms"); + + + +*/ public class CountNumBinaryStr { public static long startTime; public static long endTime;