1.Fibonacci数列:o(n) public static void Fibonacci(int n ){int a = 0;int b = 1;System.out.println(a);System.out.println(b);for (int x = 0;x < n-1 ;x++){int c = a+b;a = b;b = c;System.out.println(c);}}
第六周汇报: 汇报内容: 1、论文 2、cs231n 完结 3、tf2.0调整为pytorch,对接课题 论文:《Going Deeper with Convolutions》 Google Inc. 摘要:GoogLeNet, a 22 layers deep network, the quality of which is assessed in the context of classif