TensorFlow's Hello World Mnist数据集下载错误问题解决

部署Anaconda 科学计算包，并通过 conda install -c conda-forge tensorflow 部署tensorflow相关包。在ipython环境下执行下列命令下载训练数据包 from tensorflow.examples.tutorials.mnist import input_data mnist = input_data.read_data_set...

2017/12/05 知识扩展

LeetCode Pascal's Triangle II

Problem Given an index k, return the kth row of the Pascal’s triangle. For example, given k = 3, Return [1,3,3,1]. Note: Could you optimize your algorithm to use only O(k) extra space? 即直接返回杨辉三...

2017/12/05 算法学习

【翻译】 TensorFlow如何工作

学习TensorFlow过程中读的一篇文章，索性就翻译出来，虽然收获感觉不是很大。原文地址：How TensorFlow Works https://github.com/nfmcclure/tensorflow_cookbook/blob/master/01_Introduction/01_How_TensorFlow_Works/01_How_TensorFlow_Works.ip...

2017/12/01 知识扩展

LeetCode Pascal's Triangle

Problem Given numRows, generate the first numRows of Pascal’s triangle. For example, given numRows = 5, Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ] 没记错的话，这个应该叫杨辉三角型。很简...

2017/12/01 算法学习

LeetCode Path Sum II

Problem Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum. For example: Given the below binary tree and sum = 22, 5 ...

2017/11/30 算法学习

LeetCode Path Sum

Problem Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example: Given the below binary tr...

2017/11/27 算法学习

LeetCode Minimum Depth of Binary Tree

Problem Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. class TreeNode: def __...

2017/11/27 算法学习

LeetCode Balanced Binary Tree

Problem Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node n...

2017/11/23 算法学习

LeetCode Convert Sorted Array to Binary Search Tree

Problem Given an array where elements are sorted in ascending order, convert it to a height balanced BST. public class TreeNode { int val; TreeNode left; TreeNode right; ...