[Coding Made Simple] Number without consecutive 1s in binary representation

Given a number n, find the total number of numbers from 0 to 2^n - 1 which do not have consecutive 1s in their binary representation.

Solution.  This problem is the equivalence of fibonacci sequence. For a given n, f(n) = f(n - 1) + f(n - 2).

 1 public int getTotalNumberOfNoConsecutiveOnes(int n) {
 2     if(n == 0) {
 3         return 1;
 4     }
 5     if(n == 1) {
 6         return 2;
 7     }
 8     int[] T = new int[n + 1];
 9     T[0] = 1;
10     T[1] = 2;
11     for(int i = 2; i <= n; i++) {
12         T[i] = T[i - 1] + T[i - 2];
13     }
14     return T[n];
15 }