摘要：
自动编码器是一种有三层的神经网络：输入层、隐藏层（编码层）和解码层。该网络的目的是重构其输入，使其隐藏层学习到该输入的良好表征。 自动编码器的目标是学习函数 h(x)≈x。换句话说，它要学习一个近似的恒等函数，使得输出 x^ 近似等于输入 x。自动编码器属于神经网络家族，但它们也和 PCA（主成分分 阅读全文
posted @ 2018-03-14 10:13
bonelee
阅读(3166)
评论(2)
推荐(0)
摘要：
Invert a binary tree. to 解法1: 本质是输的先序遍历 解法2，上述DFS的迭代解法： 解法3，使用BFS： 阅读全文
posted @ 2018-03-13 23:27
bonelee
阅读(206)
评论(0)
推荐(0)
摘要：
拿来主义： 解释如下： timestamp转换为datetime 要把timestamp转换为datetime，使用datetime提供的fromtimestamp()方法： 注意到timestamp是一个浮点数，它没有时区的概念，而datetime是有时区的。上述转换是在timestamp和本地时 阅读全文
posted @ 2018-03-13 12:09
bonelee
阅读(2077)
评论(0)
推荐(0)
摘要：
Given a binary array, find the maximum number of consecutive 1s in this array. Example 1: Note: The input array will only contain 0 and 1. The length 阅读全文
posted @ 2018-03-12 23:20
bonelee
阅读(196)
评论(0)
推荐(0)
摘要：
Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l 阅读全文
posted @ 2018-03-12 22:43
bonelee
阅读(238)
评论(0)
推荐(0)
摘要：
Given two integers L and R, find the count of numbers in the range [L, R] (inclusive) having a prime number of set bits in their binary representation 阅读全文
posted @ 2018-03-11 22:48
bonelee
阅读(421)
评论(0)
推荐(0)
摘要：
Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime comple 阅读全文
posted @ 2018-03-11 22:08
bonelee
阅读(186)
评论(0)
推荐(0)
摘要：
You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 ston 阅读全文
posted @ 2018-03-11 21:54
bonelee
阅读(176)
评论(0)
推荐(0)
摘要：
Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values. Example 1: Input: 5 O 阅读全文
posted @ 2018-03-11 21:14
bonelee
阅读(268)
评论(0)
推荐(0)
摘要：
Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. The longest uncommon subsequence is defi 阅读全文
posted @ 2018-03-11 20:32
bonelee
阅读(206)
评论(0)
推荐(0)
浙公网安备 33010602011771号