xiaohahala-CSDN博客

转载 RDD：基于内存的集群计算容错抽象

RDD：基于内存的集群计算容错抽象 2014-03-13 21:39:32 Yanjun原文地址：http://shiyanjun.cn/archives/744.html该论文来自Berkeley实验室，英文标题为：Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Me

2015-12-25 15:44:00 916

转载 Spark RDD API详解(一) Map和Reduce

原文地址：https://www.zybuluo.com/jewes/note/35032Spark RDD API详解(一) Map和ReduceSparkRDD是什么？RDD是Spark中的抽象数据结构类型，任何数据在Spark中都被表示为RDD。从编程的角度来看，RDD可以简单看成是一个数组。和普通数组的区别是，RDD中的数据是分区存储的，这样不同

2015-12-25 15:33:39 520

转载动态规划0-1背包问题

动态规划0-1背包问题原文：http://blog.csdn.net/dapengbusi/article/details/7463968Ø 问题描述：给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为C。问应如何选择装入背包的物品，使得装入背包中物品的总价值最大?Ø 对于一种物品，要么装入背包，要么不装。所以对于一种物品的装入状态可以

2015-12-08 15:34:08 440

原创 leetcode Word Ladder II

鉴于该题改了一晚上加一白天，我决定写篇博客纪念纪念。Word Ladder IIMy SubmissionsQuestionTotal Accepted: 33992 Total Submissions: 255558 Difficulty: HardGiven two words (beginWord and endWord), a

2015-11-06 16:45:44 624

原创学习资料

http://codeforces.com/ OJhttps://www.topcoder.com/ OJhttps://www.coursera.org/ 在线课程https://leetcode.com/ 面试题http://norvig.com/21-days.html Teach Yourself Programming in Ten Yearsstevehanov.c

2015-11-03 15:23:55 328

原创 leetcode Rotate Image

Rotate ImageYou 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?Show TagsHa

2015-10-20 19:45:34 337

原创 leetcode Permutation Sequence

Permutation SequenceMy SubmissionsQuestion Solution Total Accepted: 40746 Total Submissions: 174549 Difficulty: MediumThe set [1,2,3,…,n] contains a total of n! unique perm

2015-10-20 15:35:22 347

原创 leetcode Next Permutation

Next PermutationMy SubmissionsQuestion Solution Total Accepted: 48550 Total Submissions: 193196 Difficulty: MediumImplement next permutation, which rearranges numbers into th

2015-10-20 09:24:59 299

转载 Summary for LeetCode 2Sum, 3Sum, 4Sum, K Sum

(中文旧版)前言:做过leetcode的人都知道, 里面有2sum, 3sum(closest), 4sum等问题, 这些也是面试里面经典的问题, 考察是否能够合理利用排序这个性质, 一步一步得到高效的算法. 经过总结, 本人觉得这些问题都可以使用一个通用的K sum求和问题加以概括消化, 这里我们先直接给出K Sum的问题描述和算法(递归解法), 然后将这个一般性的方法套用到具体的K,

2015-10-15 10:15:08 463

原创 leetcode Integer to Roman

Integer to RomanMy SubmissionsQuestion Solution Total Accepted: 43092 Total Submissions: 124603 Difficulty: MediumGiven an integer, convert it to a roman numeral.Input is g

2015-09-23 16:37:49 290

原创 leetcode Container With Most Water

Container With Most WaterMy SubmissionsQuestion Solution Total Accepted: 52710 Total Submissions: 164550 Difficulty: MediumGiven n non-negative integers a1, a2, ..., an, wh

2015-09-23 16:03:51 320

原创 leetcode Longest Palindromic Substring

Longest Palindromic SubstringMy SubmissionsQuestion Solution Total Accepted: 70417 Total Submissions: 338025 Difficulty: MediumGiven a string S, find the longest palindromic

2015-09-22 16:24:54 347

原创 leetcode Median of Two Sorted Arrays

Median of Two Sorted ArraysMy SubmissionsQuestion Solution Total Accepted: 65547 Total Submissions: 383655 Difficulty: HardThere are two sorted arrays nums1 and nums2 of si

2015-09-21 16:23:17 289

原创 leetcode Intersection of Two Linked Lists My Submissions Question Solution Total Accepted: 43555 To

Intersection of Two Linked ListsMy SubmissionsQuestion Solution Total Accepted: 43555 Total Submissions: 149194 Difficulty: EasyWrite a program to find the node at which the

2015-09-16 19:14:39 278

原创 leetcode Min Stack

Min StackMy SubmissionsQuestion Solution Total Accepted: 44056 Total Submissions: 221468 Difficulty: EasyDesign a stack that supports push, pop, top, and retrieving the minim

2015-09-16 16:51:33 319

原创 leetcode Valid Palindrome

Valid PalindromeMy SubmissionsQuestion Solution Total Accepted: 68173 Total Submissions: 309046 Difficulty: EasyGiven a string, determine if it is a palindrome, considering o

2015-09-16 16:06:03 321

原创 leetcode Pascal's Triangle II

Pascal's Triangle IIMy SubmissionsQuestion Solution Total Accepted: 51715 Total Submissions: 175265 Difficulty: EasyGiven an index k, return the kth row of the Pascal's trian

2015-09-16 14:55:38 303

原创 leetcode Pascal's Triangle

Pascal's TriangleMy SubmissionsQuestion Solution Total Accepted: 57134 Total Submissions: 188533 Difficulty: EasyGiven numRows, generate the first numRows of Pascal's triangl

2015-09-16 14:52:34 280

原创 leetcode Path Sum

Path SumMy SubmissionsQuestion Solution Total Accepted: 69449 Total Submissions: 233406 Difficulty: EasyGiven a binary tree and a sum, determine if the tree has a root-to-lea

2015-09-16 14:48:44 288

原创 leetcode Minimum Depth of Binary Tree

Minimum Depth of Binary TreeMy SubmissionsQuestion Solution Total Accepted: 70544 Total Submissions: 243160 Difficulty: EasyGiven a binary tree, find its minimum depth.The

2015-09-16 10:16:13 312

原创 leetcode Balanced Binary Tree

Balanced Binary TreeMy SubmissionsQuestion Solution Total Accepted: 72116 Total Submissions: 225116 Difficulty: EasyGiven a binary tree, determine if it is height-balanced.

2015-09-16 10:04:56 270

原创 leetcode Binary Tree Level Order Traversal II

Binary Tree Level Order Traversal IIMy SubmissionsQuestion Solution Total Accepted: 52308 Total Submissions: 167414 Difficulty: EasyGiven a binary tree, return the bottom-up

2015-09-16 09:33:17 271

原创 leetcode Maximum Depth of Binary Tree

Maximum Depth of Binary TreeMy SubmissionsQuestion Solution Total Accepted: 85301 Total Submissions: 188185 Difficulty: EasyGiven a binary tree, find its maximum depth.The

2015-09-16 09:23:56 293

原创 leetcode Binary Tree Level Order Traversal

Binary Tree Level Order TraversalMy SubmissionsQuestion Solution Total Accepted: 65805 Total Submissions: 224736 Difficulty: EasyGiven a binary tree, return the level order t

2015-09-16 09:10:56 313

原创 leetcode Symmetric Tree

Symmetric TreeMy SubmissionsQuestion Solution Total Accepted: 70743 Total Submissions: 222922 Difficulty: EasyGiven a binary tree, check whether it is a mirror of itself (ie,

2015-09-15 10:39:50 322

原创 leetcode Same Tree

Same TreeMy SubmissionsQuestion Solution Total Accepted: 78688 Total Submissions: 189358 Difficulty: EasyGiven two binary trees, write a function to check if they are equal o

2015-09-14 20:20:12 221

原创 leetcode Merge Sorted Array

Merge Sorted ArrayMy SubmissionsQuestion Solution Total Accepted: 67179 Total Submissions: 231573 Difficulty: EasyGiven two sorted integer arrays nums1 and nums2, merge nums2

2015-09-14 19:51:29 270

原创 leetcode 70Climbing Stairs

Climbing StairsMy SubmissionsQuestion Solution Total Accepted: 68776 Total Submissions: 198955 Difficulty: EasyYou are climbing a stair case. It takes n steps to reach to the

2015-09-14 09:54:01 311

原创 leetcode 67Add Binary

Add BinaryMy SubmissionsQuestion Solution Total Accepted: 55613 Total Submissions: 225733 Difficulty: EasyGiven two binary strings, return their sum (also a binary string).

2015-09-14 09:35:26 354

原创 leetcode Plus One

Plus One Total Accepted: 61952 Total Submissions: 205031My SubmissionsQuestion Solution Given a non-negative number represented as an array of digits, plus one to the number.Th

2015-09-11 16:38:36 265

原创 leetcode Length of Last Word

Length of Last Word Total Accepted: 64034 Total Submissions: 235032My SubmissionsQuestion Solution Given a string s consists of upper/lower-case alphabets and empty space charact

2015-09-11 15:53:04 252

原创 leetcode之Count and Say

这个题目关键是理解题目。别人是这样理解的。11个1，即112个1，即211个2，1个1，即1211，1个1,1个2,2个1，即111221，3个1,2个2,1个1，即312211The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211

2015-09-11 15:19:27 239

原创 leetcode36Valid Sudoku

// test36ValidSudoku.cpp : 定义控制台应用程序的入口点。//#include "stdafx.h"#include "vector"#include "iostream"using std::cout;using std::endl;using std::vector;bool isValidSudoku(vector > &boa

2015-09-10 17:54:49 258

翻译 http://www.zhihuishi.com/source/1.html

http://www.zhihuishi.com/source/1.html

2015-07-20 20:19:56 3136

ROC曲线指受试者工作特征曲线 / 接收器操作特性曲线(receiver operating characteristic curve), 是反映敏感性和特异性连续变量的综合指标,是用构图法揭示敏感性和特异性的相互关系，它通过将连续变量设定出多个不同的临界值，从而计算出一系列敏感性和特异性，再以敏感性为纵坐标、（1-特异性）为横坐标绘制成曲线，曲线下面积越大，诊断准确性越高。在ROC曲线上，最靠近

2015-06-25 15:16:04 414

转载交叉验证

交叉验证（Cross validation)，有时亦称循环估计，是一种统计学上将数据样本切割成较小子集的实用方法。于是可以先在一个子集上做分析，而其它子集则用来做后续对此分析的确认及验证。一开始的子集被称为训练集。而其它的子集则被称为验证集或测试集。交叉验证是一种评估统计分析、机器学习算法对独立于训练数据的数据集的泛化能力（generalize），交叉验证一般要尽量满足：1）

2015-06-23 16:02:39 616

转载拉格朗日对偶（Lagrange duality）

2 拉格朗日对偶（Lagrange duality）先抛开上面的二次规划问题，先来看看存在等式约束的极值问题求法，比如下面的最优化问题：目标函数是f(w)，下面是等式约束。通常解法是引入拉格朗日算子，这里使用来表示算子，得到拉格朗日公式为 L是等式约束的个数。然后分别对w和求偏导，使得偏

2015-05-27 17:14:00 584

转载深入理解拉格朗日乘子法（Lagrange Multiplier) 和KKT条件

在求取有约束条件的优化问题时，拉格朗日乘子法（Lagrange Multiplier) 和KKT条件是非常重要的两个求取方法，对于等式约束的优化问题，可以应用拉格朗日乘子法去求取最优值；如果含有不等式约束，可以应用KKT条件去求取。当然，这两个方法求得的结果只是必要条件，只有当是凸函数的情况下，才能保证是充分必要条件。KKT条件是拉格朗日乘子法的泛化。之前学习的时候，只知道直接应用两个方法，但是却

2015-05-27 16:23:21 429

转载 Exercise:Sparse Autoencoder 代码示例

练习参考Sparse Autoencoder第一步，生成训练数据。在sampleIMAGES.m文件中加入如下代码：size3D=size(IMAGES);for i=1:numpatches x=randi(size3D(1)-patchsize+1); y=randi(size3D(2)-patchsize+1); patches(:,i)

2015-05-18 09:55:34 517

转载 UFLDL稀疏自编码器练习翻译增添公式图片

这几天做UFLDL稀疏自编码器单元作业，到梯度计算步骤，总得不到正确结果。郁闷。回头看这个翻译，没有公式，读起来几乎没什么用。今天补一补。斯坦福的UFLDL是系统学习深度学习内容、弄清其知识结构的好地方，其中练习对理解概念、增强技能非常有帮助。（http://deeplearning.stanford.edu/wiki/index.php/UFLDL_Tutorial

2015-05-18 09:40:06 589

学生成绩管理系统下载

空空如也