码迷,mamicode.com
首页 >  
搜索关键字:which whereis    ( 9508个结果
HLG 1752 Page Rank (线段树)
链接: http://acm.hrbust.edu.cn/index.php?m=ProblemSet&a=showProblem&problem_id=1752 Description There are n webpages, each of which has its respective page rank. The content is constantly updated ...
分类:其他好文   时间:2014-06-09 23:32:22    阅读次数:270
关于一些设计模式(面试小问题,Java篇)
今天在某公司(不透露了)写了一套Java面试题。有个题大概是这样的。 Which design patternused in Java.lang.Runtime? 就是说java.lang.Runtime里,用了什么设计模式 还有java.utils.collection里用了什么设计模式。 当时由于对这冷门知识了解的不够多,而且api也读的少,所以一时答不上来。 回到家搜了下。...
分类:编程语言   时间:2014-06-08 18:10:17    阅读次数:547
leetcode——Longest Substring Without Repeating Characters 求链表中无重复字符的最大字串长度(AC)
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. Fo...
分类:其他好文   时间:2014-06-08 16:27:47    阅读次数:231
LeetCode之Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum....
分类:其他好文   时间:2014-06-08 15:54:08    阅读次数:258
LeetCode: Best Time to Buy and Sell Stock [121]
【题目】 Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit. ...
分类:其他好文   时间:2014-06-08 15:11:58    阅读次数:298
[LeetCode]Distinct Subsequences,解题报告
题目 Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed from the original string by deleting some (can be...
分类:其他好文   时间:2014-06-08 14:49:14    阅读次数:347
projecteuler---->problem=23----Non-abundant sums
A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means th...
分类:其他好文   时间:2014-06-08 04:05:14    阅读次数:315
[LeetCode] Longest Substring Without Repeating Characters [15]
题目:Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length...
分类:其他好文   时间:2014-06-08 03:06:52    阅读次数:221
LeetCode:Minimum Path Sum
题目链接 Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its p...
分类:其他好文   时间:2014-06-07 21:59:08    阅读次数:344
fork() in linux
About fork() in linux:parent/child processes created by fork() share the same file table (linux file descriptor or called `open file descriptor`)Which...
分类:系统相关   时间:2014-06-07 21:47:58    阅读次数:443
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!