码迷,mamicode.com
首页 >  
搜索关键字:not find    ( 24186个结果
Best Time to Buy and Sell Stock II
Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a...
分类:其他好文   时间:2014-07-09 23:32:44    阅读次数:276
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 fol...
分类:其他好文   时间:2014-07-09 23:00:38    阅读次数:208
[leetcode] Max Points on a Line
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.
分类:其他好文   时间:2014-07-08 00:41:49    阅读次数:235
CTCI 2.2
Implement an algorithm to find the kth to last element of a singly linked list.Classical "Runner" Technique of linkedlist/*Use two pointers, forward o...
分类:其他好文   时间:2014-07-08 00:37:17    阅读次数:315
ZOJ3605-Find the Marble(概率DP)
Find the Marble Time Limit: 2 Seconds      Memory Limit: 65536 KB Alice and Bob are playing a game. This game is played with several identical pots and one marble. When the game starts, Alice...
分类:其他好文   时间:2014-07-06 11:35:34    阅读次数:133
LeetCode——Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. 给定一个字符串S,找出其中的最长回文...
分类:其他好文   时间:2014-07-06 00:15:15    阅读次数:240
didn't find class on path dexpathlist错误解决办法
今天在写slidingmenu和fragment示例demo的时候,发现应用程序部署到手机会直接崩掉,logcat里面提示的消息如下: 出现了didn't find class on path dexpathlist错误,于是上google搜答案,发现stackoverflow上面有很多人遇到这个问题,于是找了个赞比较多的答案,看了看,确实是那么回事,之前从actionbarsherlo...
分类:其他好文   时间:2014-07-06 00:09:59    阅读次数:443
UVa 1329 - Corporative Network Union Find题解
UVa的题目好多,本题是数据结构的运用,就是Union Find并查集的运用。主要使用路径压缩。甚至不需要合并树了,因为没有重复的连线和修改单亲节点的操作。 郁闷的就是不太熟悉这个Oj系统,居然使用库中的abs就会WA,自己写了个abs小函数就过了。 题目:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&...
分类:Web程序   时间:2014-07-05 23:39:10    阅读次数:339
LeetCode——Median of Two Sorted Arrays
There are two sorted arrays A and B of size m and n respectively.  Find the median of the two sorted arrays.  The overall run time complexity should be O(log (m+n)). 有两个已排序的数组A和B,大小为m 和 n。 找出两数组的中...
分类:其他好文   时间:2014-07-05 22:54:17    阅读次数:244
winform窗体中查找控件
private RichTextBox FindControl() { RichTextBox ret = null; try { Control[] controls = Application.OpenForms["MainForm"].Controls.Find("txtContent", ....
分类:Windows程序   时间:2014-07-05 20:56:38    阅读次数:433
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!