Count the number of binary strings without consecutive 1’s

Starting from a given length, find all the possible distinct binary strings of that length, in such a way that there are no consecutive ones.

Input: int length = 3; Output: 5 Explanation: The strings are: 000, 001, 010, 100, 101.

Solution:

1. static int countBinaryStrings(int length) { 2. int[] endingIn0 = new int[length]; 3. int[] endingIn1 = new int[length]; 4. endingIn0[0] = endingIn1[0] = 1; 5. for (int i = 1; i < length; i++) { 6. endingIn0[i] = endingIn0[i - 1] + endingIn1[i - 1]; 7. endingIn1[i] = endingIn0[i - 1]; 8. } 9. return endingIn0[length - 1] + endingIn1[length - 1]; 10. } 11.

Postări recente

Afișează-le pe toate

Weighted Job Scheduling in JAVA

You receive a list of jobs that have three elements: start time, finish time and profit. You have to schedule the jobs with no overlapping, in order to obtain the maximum profit. Solution: 1. static

Total number of non-decreasing numbers with n digits in JAVA

A non-decreasing number has every digit greater than or equal to the previous digit. Given the number of digits, find how many numbers exist with non-decreasing digits. Solution: 1. static int co

Tiling Problem in JAVA

You can use a board that is 2 x n size. The tiles are of size 2 x 1. Count the number of ways to tile the board. Tiles can be placed vertically 2 x 1 or horizontally as 1 x 2. Solution: 1. static

Art

Coding

Count the number of binary strings without consecutive 1’s

Postări recente