码迷,mamicode.com
首页 >  
搜索关键字:not find    ( 24186个结果
js处理iframe中子页面与父页面里面对象的取得的解决方案
【1】子页面取得父页面的dom对象 parent.window.$('#id').val("");【2】父页面取得子页面的对象 $(window.frames["iframeName"].document).find('#subjectDg').datagrid('acceptChanges'); ...
分类:Web程序   时间:2014-06-26 20:24:06    阅读次数:228
Jquery 获取所有对象的第一个子元素
转自:http://blog.sina.com.cn/s/blog_5fdbd0410100pmnn.htmlJohnKarlBrandon获取第一个元素:$("ul li:first-child")JohnKarlBrandon获取第一个元素:$("#getfirst").find("ul li:...
分类:Web程序   时间:2014-06-26 19:37:50    阅读次数:702
Linux命令之type,whatis,whereis,which,locate,find
第一个:type--查询一个命令的类型 -查询一个命令为内部或者外部命令的命令; -linux的众多命令中,有内部命令和外部命令,这时可以用type命令来查询一个命令到底是属于内部命令还是属于外部命令; -内部命令和外部命令的区分方法:在系统中有存储位置的为外部命令,没有存储位置的为内部命令,因为内...
分类:系统相关   时间:2014-06-26 17:50:23    阅读次数:292
解决IE中无法使用jquery.find方法解析xml字符串的方法
getResult:function(data){ data=data.replace(/"/g,"'"); var xml; //解决办法 if( typeof data == "string" ){ xml = new ActiveXObject("Microsoft.XMLDOM");...
分类:Web程序   时间:2014-06-26 10:42:33    阅读次数:267
leetcode--Edit Distance
Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You have the fol...
分类:其他好文   时间:2014-06-25 11:14:15    阅读次数:218
Leetcode: Longest Valid Parentheses
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the lon...
分类:其他好文   时间:2014-06-25 11:07:45    阅读次数:230
Just a complaint about the college examinations
Well , you know. As a college student who want to find a good job after graduating  like me , scores are not that important. I just want to have some low scores which can help me graduate successfully...
分类:其他好文   时间:2014-06-25 09:59:37    阅读次数:202
LeetCode:Substring with Concatenation of All Words (summarize)
题目链接You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a conca...
分类:其他好文   时间:2014-06-25 09:42:27    阅读次数:230
LeetCode: Longest Consecutive Sequence [128]
【题目】 Given an unsorted array of integers, find the length of the longest consecutive elements sequence. For example, Given [100, 4, 200, 1, 3, 2], The longest consecutive elements sequence is [1, 2, 3, 4]. Return its length: 4. Your algorithm should run...
分类:其他好文   时间:2014-06-25 07:55:42    阅读次数:244
iframe jquery
$(window.frames[2].document.body).find(‘#strTaketime‘).val() $(window.frames[‘f‘].document.body).find(‘#strTaketime‘).val() $(top.document.body).find(‘#strTaketime‘).val()
分类:Web程序   时间:2014-06-25 06:34:52    阅读次数:191
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!