C#实现斐波那契数列

        /// <summary>
        /// 递归获取第n项的值
        /// </summary>
        /// <param name="n">第n项（大于0的正整数）</param>
        /// <returns>第n项的值</returns>
        static int GetFei(int n)
        {           
            if (n > 2)
            {
                double temp = GetFei(n - 1) + GetFei(n - 2);
                if (temp > int.MaxValue)
                {
                    return 0;
                }
                else
                {
                    return (int)temp;
                }
            }
            else
            {
                return n > 0 ? 1 : 0;
            }           
        }
    }
}