Fibonacci Number LeetCode solution in Java

1
class Solution {
2
  public int fib(int n) {
3
    if (n == 0) return 0;
4
    if (n == 1) return 1;
5
    int[] Fibonacci = new int[n + 1];
6
    Fibonacci[0] = 0;
7
    Fibonacci[1] = 1;
8
    for (int i = 2; i < n + 1; i++) Fibonacci[i] = Fibonacci[i - 1] + Fibonacci[i - 2];
9
    return Fibonacci[n];
10
  }
11
}