@@ -0,0 +1,386 @@
+class Solution %7B%0A    /**%0A     * @param n: an integer%0A     * @return an integer f(n)%0A     */%0A    public int fibonacci(int n) %7B%0A        int first = 0;%0A        int second = 1;%0A        int current = n == 1 ? 0 : 1;%0A        for(int i = 2; i %3C n; i++) %7B%0A            current = first + second;%0A            first = second;%0A            second = current;%0A        %7D%0A        return current;%0A    %7D%0A%7D%0A

Add problem of fibonacci solution by xxcxy