public class Solution { public int Fibonacci(int n) { int target=0; if(n==0) return 0; if(n==1) return 1; int one=0; int two=1; for(int i=2;i<=n;i++){ target=one+two; one=two; two=target; } return target; }}原文：http://www.cnblogs.com/bb3q/p/5084170.html