用迭代的方式求斐波那契数

public class FibNumberByIteration {

    /**
     * 求索引为index的斐波那契数
     * @param index
     * @return
     */
    public static int fb(int index) {
        if(index <= 1)
            return index;
        int fa = 0, fb = 1;
        int i = 2;
        int temp;
        while(i <= index){
            temp = fa + fb;
            fa = fb;
            fb = temp;
            i++;
        }
        return fb;
    }

    public static void main(String[] args) {
        for(int index =0;index<=10;index++)
            System.out.println(fb(index));
    }
}