码迷,mamicode.com
首页 >  
搜索关键字:constant    ( 1663个结果
Sort List 【leetCode】
目录: 1、题目及分析     1.1 题目     1.2 分析 1、题目及分析 1.1 题目:     Sort a linked list in O(n log n) time using constant space complexity. 1.2 分析     O(n log n)的复杂度,所以不能采用冒泡等,这里采用合并排序算法,且为了不采用递归的方式,...
分类:其他好文   时间:2014-11-21 16:17:51    阅读次数:138
【转】An Intuitive Guide To Exponential Functions & e
An Intuitive Guide To Exponential Functions & eehas always bothered me — not the letter, but themathematical constant. What does it really mean?Math b...
分类:其他好文   时间:2014-11-20 13:39:46    阅读次数:301
three.js 源码注释(十五)Math/Plane.js
以下代码是THREE.JS 源码文件中Math/Plane.js文件的注释. Plane对象的构造函数.用来在三维空间内创建一个法线向量为normal,从原点到平面的距离为constant的无限延展的二维平面对象.Plane对象的功能函数采用 定义构造的函数原型对象来实现. 用法: var normal = new Vector3(0,0,0),constant = 5.5; var Plane = new Plane(normal,constant); 创建一个法线向量是0,0,0原点到平面的距离是5...
分类:Web程序   时间:2014-11-19 16:05:34    阅读次数:386
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() -- Get ...
分类:其他好文   时间:2014-11-19 14:13:08    阅读次数:149
Go by Example: Constants
Go by Example: Constants...
分类:其他好文   时间:2014-11-19 11:31:47    阅读次数:158
LeetCode Solutions : Sort List
Sort a linked list inO(nlogn) time using constant space complexity.O(nlogn),我们可以第一时间想到常用的二路归并排序,快速排序和堆排序,其中快排和堆排只适用于线性表,即数组,故这道编程题毫无疑问用二路归并排序;* 1. 利用一...
分类:其他好文   时间:2014-11-19 07:24:33    阅读次数:225
Go by Example: Constants
Go by Example: Constants...
分类:其他好文   时间:2014-11-19 01:31:16    阅读次数:142
LeetCode: Min Stack 解题报告
Min Stack My SubmissionsQuestionSolutionDesign a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Pu...
分类:其他好文   时间:2014-11-19 00:15:08    阅读次数:271
OpenCV Tutorials —— Adding borders to your images
扩展图像边界: BORDER_CONSTANT: Pad the image with a constant value (i.e. black or BORDER_REPLICATE: The row or column at the very edge of the original is re...
分类:其他好文   时间:2014-11-18 23:44:20    阅读次数:338
【leetcode】Min Stack -- python版
题目描述:Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Re...
分类:编程语言   时间:2014-11-18 23:14:32    阅读次数:198
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!