- 博客(22)
- 资源 (11)
- 收藏
- 关注
RSS订阅原创 【LeetCode从零单刷】Combinations & Combination Sum 系列
题目：Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3],
2015-10-31 22:35:41
2639
原创 【LeetCode从零单刷】Search a 2D Matrix I & II
题目：Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first intege
2015-10-30 11:10:10
1240
2
原创 【LeetCode从零单刷】Kth Smallest Element in a BST
题目：Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.Note: You may assume k is always valid, 1 ≤ k ≤ BST's total elements.Follow up:Wh
2015-10-30 10:36:37
1495
2
原创 【LeetCode从零单刷】Symmetric Tree
题目：Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3
2015-10-29 22:02:12
1239
2
原创 C++从零实现BP神经网络
BP（backward propogation）神经网络实现过程中的一些学习资料、心得，以及最终的源码实现，力求通俗、易懂
2015-10-27 22:50:31
30319
13
原创 Andrew Ng Machine Learning 专题【Large Scale Machine Learning】
此文是斯坦福大学，机器学习界 superstar — Andrew Ng 所开设的 Coursera 课程：Machine Learning 的课程笔记。力求简洁，仅代表本人观点，不足之处希望大家探讨。 课程网址：https://www.coursera.org/learn/machine-learning/home/welcome
2015-10-25 11:48:36
2364
原创 Andrew Ng Machine Learning 专题【Recommender Systems】
此文是斯坦福大学，机器学习界 superstar — Andrew Ng 所开设的 Coursera 课程：Machine Learning 的课程笔记。力求简洁，仅代表本人观点，不足之处希望大家探讨。 课程网址：https://www.coursera.org/learn/machine-learning/home/welcomeWeek 9 前半部分 Anomaly Detection：htt
2015-10-22 22:40:49
2953
原创 Andrew Ng Machine Learning 专题【Anomaly Detection】
此文是斯坦福大学，机器学习界 superstar — Andrew Ng 所开设的 Coursera 课程：Machine Learning 的课程笔记。力求简洁，仅代表本人观点，不足之处希望大家探讨。 课程网址：https://www.coursera.org/learn/machine-learning/home/welcomeWeek 9 后半部分 Recommender Systems：敬
2015-10-22 15:42:01
2698
原创 Andrew Ng Machine Learning 专题【PCA】
此文是斯坦福大学，机器学习界 superstar — Andrew Ng 所开设的 Coursera 课程：Machine Learning 的课程笔记。力求简洁，仅代表本人观点，不足之处希望大家探讨。 课程网址：https://www.coursera.org/learn/machine-learning/home/welcomeWeek 8 前半部分 K-Means：http://blog.c
2015-10-15 16:32:35
3230
原创 【LeetCode从零单刷】Balanced Binary Tree
题目：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 ne
2015-10-14 21:18:57
1441
原创 【LeetCode从零单刷】Find Peak Element
题目：A peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.The array may contain multiple peaks
2015-10-14 20:53:05
1432
原创 【LeetCode从零单刷】Container With Most Water
题目：Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and
2015-10-13 23:35:59
715
原创 【LeetCode从零单刷】Rotate Image
题目：You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?解答：一开始想的很复杂，希望找到一个通式应对所有角度的旋转。所有的细节写在《【图像处
2015-10-13 22:13:56
1573
原创 【LeetCode从零单刷】Spiral Matrix II
题目：Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9
2015-10-13 21:49:18
1327
原创 Andrew Ng Machine Learning 专题【K-Means】
此文是斯坦福大学，机器学习界 superstar — Andrew Ng 所开设的 Coursera 课程：Machine Learning 的课程笔记。力求简洁，仅代表本人观点，不足之处希望大家探讨。 课程网址：https://www.coursera.org/learn/machine-learning/home/welcomeWeek 1: Introduction 笔记：http://bl
2015-10-10 20:57:27
2442
原创 【LeetCode从零单刷】Find the Duplicate Number
题目：Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate n
2015-10-10 09:51:21
3309
原创 【LeetCode从零单刷】Majority Element
题目：Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.
2015-10-10 09:10:59
1157
原创 【LeetCode从零单刷】Move Zeroes
题目：Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after ca
2015-10-10 08:50:57
1313
SPH 流体动画源代码
2014-11-24
邮箱地址列表语法分析（附实验报告）
2013-01-05
邮箱地址列表词法分析（附实验报告）
2013-01-04
邮箱地址列表词法分析（含实验报告）
2013-01-04
计算机网络（谢希仁著，第五版）
2012-09-28
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人