Hedvig Interview - Count of number with no consecutive 1's
Given integer n, find the number of different binary strings of size n where there are no consecutive 1's.Eg: If n is 2, valid strings are 00, 01, 10. You should return 3.
假设f(n, k)是第n位上为k的数字