将者，智、信、仁、勇、严也。

摘要： You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo 阅读全文

摘要： Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or 阅读全文

摘要： Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA on Wikipedia 阅读全文

摘要： Given a non-empty array of digits representing a non-negative integer, plus one to the integer. The digits are stored such that the most significant d 阅读全文

摘要： 手写汉字笔迹识别模型： 第一名用的是googleNet，准确率97.3% def GoogleLeNetSlim(x, num_classes, keep_prob=0.5): with tf.variable_scope('main'): t = slim.conv2d(x, 64, [3, 3], [1, 1], padding='SAME', activation_... 阅读全文

摘要： www.arocmag.com/getarticle/?aid=4e02d91c19b0cced Internet 蠕虫防范技术研究http://www.arocmag.com/article/1001-3695(2010)03-1032-03.html 基于统计分析建立流量动态临界线的蠕虫检测机制 阅读全文

摘要： Write a program to check whether a given number is an ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. Example 阅读全文

摘要： The set S originally contains numbers from 1 to n. But unfortunately, due to the data error, one of the numbers in the set got duplicated to another n 阅读全文

摘要： Having said that, you can query sklearn.preprocessing.StandardScaler for the fit parameters: scale_ : ndarray, shape (n_features,) Per feature relativ 阅读全文

摘要： 实验结果： MLP 隐藏层神经元个数 128 test confusion_matrix (SMOTE): 测试数据的混淆矩阵[[131946 120] [ 299 131767]] precision recall f1-score support 0 1.00 1.00 1.00 132066 阅读全文