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

摘要： tsne 数据不做预处理： 数据做standard标准化处理 使用pca，不进行预处理： 使用standard scaler预处理，再做pca： 最后效果： 最后使用自编码器来来降维： 代码： 如果是迭代次数不一样，则可能有一些差别，见下图，和上面的可能有些差别： 修改64为128: 阅读全文

摘要： 只需要在打开的时候指定编码 只需要在打开的时候指定编码 fo = open(file, 'rb') dict = pickle.load(fo,encoding='iso-8859-1') 阅读全文

摘要： You are given a license key represented as a string S which consists only alphanumeric character and dashes. The string is separated into N+1 groups b 阅读全文

摘要： Given an array of integers nums, write a method that returns the "pivot" index of this array. We define the pivot index as the index where the sum of 阅读全文

摘要： 输出示例： neigh.kneighbors(white_verify)(array([[ 0.01140831], [ 0.0067373 ], [ 0.00198682], [ 0.00686728], [ 0.00210445], [ 0.00061413], [ 0.00453888]]), 阅读全文

摘要： 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_... 阅读全文