Solving Fibonacci Number in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

F(N) = F(N - 1) + F(N - 2), for N > 1.

Example 1:

Input: 2
Output: 1
Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1.

Example 2:

Input: 3
Output: 2
Explanation: F(3) = F(2) + F(1) = 1 + 1 = 2.

Example 3:

Input: 4
Output: 3
Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3.

Note:

F(0) = 0,   F(1) = 1

See the full details of the problem Fibonacci Number at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go