码迷,mamicode.com
首页 >  
搜索关键字:find 排除某些目录    ( 24187个结果
hdu 1596 find the safest road (最短路径)
find the safest roadTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6119Accepted Submission(s): 2...
分类:其他好文   时间:2014-05-27 02:49:10    阅读次数:229
jquery获得下拉框值的代码
jquery获得下拉框值的代码获取Select :获取select 选中的 text :$("#ddlRegType").find("option:selected").text();获取select选中的 value:$("#ddlRegType ").val();获取select选中的索引:$(...
分类:Web程序   时间:2014-05-27 02:38:48    阅读次数:270
[转载]爱上一个给予你正能量的人
You Should Fall In Love With Someone Who InspiresYouFEB. 5, 2014BySTEPHANIE ALTHOFThere’s one trait that I continuously find myself coming back to whe...
分类:其他好文   时间:2014-05-24 07:45:20    阅读次数:264
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 longes...
分类:其他好文   时间:2014-05-24 04:45:39    阅读次数:245
汇编语言-判断素数:找出前100以内的素数
1. 题目:找出前100个素数。2. 要求:将前100个素数找出并显示值,要求每行显示5个素数。先列出求100以内素数的C++代码然后根据C++代码写汇编代码,相对来说比较容易。 1 //The program is to find the primes from 1 to 100 with C++...
分类:编程语言   时间:2014-05-24 04:23:06    阅读次数:450
64位matlab mex64位编译器解决方案
安装libsvm的时候用到了mex -setup,有的会报 Could not find the 64-bit compiler. This may indicate that the "X64 Compilers and Tools" or the Microsoft Windo...
分类:其他好文   时间:2014-05-24 03:59:31    阅读次数:387
LeetCode:Longest Substring Without Repeating Characters(最长不重复子串)
题目链接Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letter...
分类:其他好文   时间:2014-05-24 02:15:57    阅读次数:291
LeetCode: Maximum Depth of Binary Tree 题解
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le...
分类:其他好文   时间:2014-05-23 11:54:10    阅读次数:317
hdu 1232 畅通工程
题目:     链接:点击打开链接 算法:     赤裸裸的并查集。 代码: #include #include #include using namespace std; int n,m; int root[1010]; int find(int x) { int r = x; while(root[r] != r) r = root[r]; ...
分类:其他好文   时间:2014-05-22 10:36:30    阅读次数:219
LeetCode:Single Number II
题目:     Given an array of integers, every element appears three times except for one. Find that single one.     Note:     Your algorithm should have a linear runtime complexity. Could you implem...
分类:其他好文   时间:2014-05-20 16:22:52    阅读次数:241
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!