码迷,mamicode.com
首页 >  
搜索关键字:the most fundamental    ( 3981个结果
Leetcode之Best Time to Buy and Sell Stock
Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie...
分类:其他好文   时间:2016-01-12 15:20:29    阅读次数:112
121. Best Time to Buy and Sell Stock
Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie...
分类:其他好文   时间:2016-01-11 17:50:28    阅读次数:129
Jan 09 - Count Primes; Mathematics; Optimization; Primes; DP;
第一种方法TheSieve of Eratosthenesis one of the most efficient ways to find all prime numbers up ton.The Sieve of Eratosthenes uses an extra O(n) memory an...
分类:其他好文   时间:2016-01-10 14:17:47    阅读次数:118
Lucky 2048 - The secret of being lucky
Lucky 2048 uses a normal distribution to create "lucky" start. Generally speaking, it provides lucky chances "most likely to be medium result, and ver...
分类:其他好文   时间:2016-01-07 20:19:44    阅读次数:209
python : dictionary changed size during iteration
1. 错误方式#这里初始化一个dict>>> d = {'a':1, 'b':0, 'c':1, 'd':0}#本意是遍历dict,发现元素的值是0的话,就删掉>>> for k in d:... if d[k] == 0:... del(d[k])...Traceback (most ...
分类:编程语言   时间:2016-01-06 19:55:20    阅读次数:286
【转】ubuntu下最好用的输入法fcitx-sunpinyin
http://www.freetstar.com/index.php/ubuntu-most-use-friendly-fcitx-sunpinyin今天难得折腾一会儿输入法,对于系统美化方面的东西我比较模糊,神马字体渲染阿,输入法模糊音阿对我来说统统比较模糊。隐约记得是@Houge_Langley...
分类:系统相关   时间:2016-01-06 15:56:54    阅读次数:275
Working with SSH keys
SSH keys are a way to identify trusted computers, without involving passwords. Most git servers choose SSH keys to authorize clients. Check for SSH ke...
分类:其他好文   时间:2016-01-06 13:46:46    阅读次数:137
dlmalloc 2.8.6 源代码具体解释(6)
本文章由vector03原创, 转载请注明出处.邮箱地址: mmzsmm@163.com, 欢迎来信讨论.3.4 sys_allocsys_alloc是dlmalloc中向系统获取内存的主要接口.因为涉及到mmap, top-most segment, top chunk的交互,相对要更复杂. 我们...
分类:其他好文   时间:2016-01-05 18:55:41    阅读次数:197
LeetCode(66): Plus one
Plus One: Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant ...
分类:其他好文   时间:2016-01-05 13:59:28    阅读次数:180
LeetCode 219:Contains Duplicate II
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and jis at most k. ...
分类:其他好文   时间:2016-01-04 11:45:17    阅读次数:216
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!