2014年11月_leonordo

12月 11月 09月 08月 07月

原创 leetcode 之Find Minimum in Rotated Sorted Array II

Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find the minimum element. The array may contain duplicates. 思

2014-11-26 20:10:26 547

原创 leetcode 之Find Minimum in Rotated Sorted Array

问题： Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find the minimum element. You may assume no duplicate e

2014-11-26 19:47:46 601

原创 leetcode 之 Merge Sorted Array

问题： Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may assume that A has enough space (size that is greater or equal to m + n) to hold additional eleme

2014-11-26 00:11:09 461

原创 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

2014-11-25 20:40:12 435

原创 leetcode 之 Pow(x, n)

问题： Implement pow(x, n). 思路：　这题在算法导论

2014-11-23 16:53:07 504

原创 leetcode 之 Triangle

问题： Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the following triangle [ [2], [3

2014-11-23 15:58:18 449

原创 leetcode 之 Climbing Stairs

Climbing Stairs

2014-11-23 15:08:43 479

原创 leetcode 之 Pascal's Triangle II

问题： 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?

2014-11-20 21:44:07 513

原创 leetcode 之 Pascal's Triangle

问题： 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] ] class Solution {

2014-11-20 20:51:08 396

原创 backpropagation algorithm 理解

看了stanford的deep learning教程关于bp算法的介绍：http://ufldl.stanford.edu/wiki/index.php/Backpropagation_Algorithm

2014-11-18 20:16:46 2795

原创 leetcode 之 Search Insert Position

问题： 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 order. You may assume no duplicates in t

2014-11-17 14:17:51 430

原创 leetcode 之 Min Stack

问题： Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top(

2014-11-15 13:54:06 3738 1

原创 leetcode 之 Unique Binary Search Trees

问题： Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For example, Given n = 3, there are a total of 5 unique BST's. 1 3 3 2

2014-11-15 12:14:01 554

原创机器学习之抽样检查的重要性

原文： http://machinelearningmastery.com/why-you-should-be-spot-checking-algorithms-on-your-machine-learning-problems/

2014-11-11 16:30:23 1692

原创 leetcode 之 Word Ladder

问题： Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that: Only one letter can be changed at a timeEach intermedia

2014-11-11 14:26:15 577

原创 Leetcode 之 Same Tree

问题： Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

2014-11-10 11:27:19 401

原创 leetcode 之 Subsets

问题： Given a set of distinct integers, S, return all possible subsets.

2014-11-07 13:41:53 513

原创 C++ 运行状态分析工具

在运行c++程序，需要记录每个函数的yunxing

2014-11-06 13:56:52 1464

原创 leetcode 之 Maximum Depth of Binary Tree

问题： 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 leaf node. 方法一. 广度优先遍历，利用队列，在每一层的结尾

2014-11-06 13:46:17 650

Learning Spark

spark 作者自己最新写的书。这是作者目前自己放出来的。

2015-01-07

Undocument Windows NT中文版.chm

2010-12-21

驱动程序超级宝典--翟洪涛译

经典，不用多说，是被译为中文的MSDN DDK文档。

2009-11-05

Software Architecture4+1

本文基于多个并发视图的使用情况来说明描述软件密集型系统架构的模型。使用多重视图允许独立地处理各"风险承担人"：最终用户、开发人员、系统工程师、项目经理等所关注的问题，并且能够独立地处理功能性和非功能性需求。本文分别对五种视图进行了描述，并同时给出了捕获每种视图的表示方法。这些视图使用以架构为中心的、场景驱动以及迭代开发过程来进行设计。

2009-03-15

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人