Arwind的专栏

这道题非常简单，只需要使用一个简单的递归即可得到结果： 规律为从第三个数开始： F(n) = F(n-1) + F(n-2) C#代码： public int Foo(int n) { if (n == 0) { return 1; }

这道题需要使用一个中介Dictionary存储相同元素的值的个数, 并且输出： int[] source = new int[]{1,2,3,1,1}; int flag = source/2; if(source.length%2 == 1) flag += 1; Dictionary list = new Dictionary(); foreach(int ele in

Being able to apply statistics is like having a secret superpower. Where most people see averages, you see confidence intervals. When someone says “7 is greater than 5,” you declare that they're rea