﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>语源科技BlogJava-梦想帝国</title><link>http://www.blogjava.net/limiaojian/</link><description>音乐，程序</description><language>zh-cn</language><lastBuildDate>Sun, 12 Apr 2026 11:56:11 GMT</lastBuildDate><pubDate>Sun, 12 Apr 2026 11:56:11 GMT</pubDate><ttl>60</ttl><item><title>用最少的循环次数求出两个数组中的相同元素</title><link>http://www.blogjava.net/limiaojian/archive/2012/10/30/390484.html</link><dc:creator>天鹰之翼</dc:creator><author>天鹰之翼</author><pubDate>Tue, 30 Oct 2012 14:34:00 GMT</pubDate><guid>http://www.blogjava.net/limiaojian/archive/2012/10/30/390484.html</guid><wfw:comment>http://www.blogjava.net/limiaojian/comments/390484.html</wfw:comment><comments>http://www.blogjava.net/limiaojian/archive/2012/10/30/390484.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.blogjava.net/limiaojian/comments/commentRss/390484.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/limiaojian/services/trackbacks/390484.html</trackback:ping><description><![CDATA[
<div>问题：有两个长度分别为M和N的数组，用最少的循环次数求出他们中的相同元素。<br />分析：用容器来解决。将这两个数组分别放在两个ArrayList中，再调用ArrayList的retainAll方法即可。<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;A.retainAll(B):从A集合中删除B集合中不包含的元素.<br />实现代码如下：<br /><p>package com.miaojian.li;</p><p>import java.util.ArrayList;<br />import java.util.Collection;</p><p>public class FindFromArray {</p><p>&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;public static void main(String[] args) {</p><p>&nbsp;&nbsp;&nbsp; int[] array1={1,2,3,4,5,6,7};<br />&nbsp;&nbsp;&nbsp; int[] array2={2,4,6,8,10,1};<br />&nbsp;&nbsp;&nbsp; Collection c1=new ArrayList();<br />&nbsp;&nbsp;&nbsp; Collection c2=new ArrayList();<br />&nbsp;&nbsp;<br />&nbsp;&nbsp;&nbsp; for(int i=0;i&lt;array1.length;i++)&nbsp;&nbsp;&nbsp; //将array1添加到c1中<br />&nbsp;&nbsp;&nbsp; {<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;c1.add(array1[i]);<br />&nbsp;&nbsp;&nbsp; }<br />&nbsp;&nbsp; &nbsp;for(int i=0;i&lt;array2.length;i++)&nbsp;&nbsp; //将array2添加到c2中<br />&nbsp; &nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;c2.add(array2[i]);<br />&nbsp;&nbsp; }<br />&nbsp;&nbsp; c1.retainAll(c2);&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; //从c1集合中删除c2集合中不包含的元素<br />&nbsp;&nbsp; System.out.println(c1);<br />&nbsp;&nbsp; }<br />}<br />因此总的循环次数是M+N<br />结果如下 ：</p>[1, 2, 4, 6]<br /><br /></div> 
<img src ="http://www.blogjava.net/limiaojian/aggbug/390484.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/limiaojian/" target="_blank">天鹰之翼</a> 2012-10-30 22:34 <a href="http://www.blogjava.net/limiaojian/archive/2012/10/30/390484.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>用递归的方法列出文件目录结构</title><link>http://www.blogjava.net/limiaojian/archive/2012/10/30/390443.html</link><dc:creator>天鹰之翼</dc:creator><author>天鹰之翼</author><pubDate>Tue, 30 Oct 2012 03:59:00 GMT</pubDate><guid>http://www.blogjava.net/limiaojian/archive/2012/10/30/390443.html</guid><wfw:comment>http://www.blogjava.net/limiaojian/comments/390443.html</wfw:comment><comments>http://www.blogjava.net/limiaojian/archive/2012/10/30/390443.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/limiaojian/comments/commentRss/390443.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/limiaojian/services/trackbacks/390443.html</trackback:ping><description><![CDATA[
<p>package com.miaojian.li;</p><p>import java.io.File;</p><p>public class FileList {<br />&nbsp;<br />&nbsp;&nbsp;&nbsp; public static void main(String[] args) {<br />&nbsp;&nbsp;<br />&nbsp;&nbsp;&nbsp; File f= new File("d:/software");//待列出的文件目录<br />&nbsp;&nbsp;&nbsp; tree(f,0);<br />&nbsp;&nbsp;&nbsp; }<br />&nbsp;&nbsp;&nbsp; private static void tree(File f, int level)<br />&nbsp;&nbsp;&nbsp; {<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;String preStr="";<br />&nbsp;&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for(int i=0;i&lt;level;i++)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; preStr+="&nbsp;&nbsp;&nbsp; ";<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;File[] childs=f.listFiles();<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for(int i=0;i&lt;childs.length;i++)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;System.out.println(preStr + childs[i].getName());<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if(childs[i].isDirectory())<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;tree(childs[i],level+1);<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }<br />&nbsp;&nbsp;&nbsp;}</p><p>}<br />结果如下图：<br /></p>DataBase<br />&nbsp;&nbsp;&nbsp; Mysql<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; mysqltoolwin32.rar<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; MySQL_5.5.20_win32_XiaZaiBa.zip<br />&nbsp;&nbsp;&nbsp; Oracle<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Oracle_client_win32.zip<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Toad DBA Suite for Oracle 10.5 Commercial.exe<br />&nbsp;&nbsp;&nbsp; SqlServer<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Power Design<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; powerdesigner125_eval.exe<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; SQL Server2000<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; PERSONAL<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; AUTORUN.EXE<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; AUTORUN.INF<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; AUTORUN.INI<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; BOOKS<p>&nbsp;</p><p><br /></p>
<img src ="http://www.blogjava.net/limiaojian/aggbug/390443.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/limiaojian/" target="_blank">天鹰之翼</a> 2012-10-30 11:59 <a href="http://www.blogjava.net/limiaojian/archive/2012/10/30/390443.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>测试static修饰的方法是否可以被复写</title><link>http://www.blogjava.net/limiaojian/archive/2012/10/29/390422.html</link><dc:creator>天鹰之翼</dc:creator><author>天鹰之翼</author><pubDate>Mon, 29 Oct 2012 13:48:00 GMT</pubDate><guid>http://www.blogjava.net/limiaojian/archive/2012/10/29/390422.html</guid><wfw:comment>http://www.blogjava.net/limiaojian/comments/390422.html</wfw:comment><comments>http://www.blogjava.net/limiaojian/archive/2012/10/29/390422.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/limiaojian/comments/commentRss/390422.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/limiaojian/services/trackbacks/390422.html</trackback:ping><description><![CDATA[<p>package com.miaojian.li;<br />//测试static修饰的方法是否可以被复写。<br />public class TT {</p><p>&nbsp;public static void getName()<br />&nbsp;{<br />&nbsp;&nbsp;System.out.println("TT");<br />&nbsp;}<br />&nbsp;public static void main(String[] args) {<br />&nbsp;&nbsp;<br />&nbsp;&nbsp;TT tt=new TT();<br />&nbsp;&nbsp;tt.getName();<br />&nbsp;}<br />}</p><p>class T extends TT<br />{<br />&nbsp;public static void getName()<br />&nbsp;{<br />&nbsp;&nbsp;System.out.println("T");<br />&nbsp;}<br />}</p><br />运行父类，得到的结果为：TT<br />运行子类，得到的结果为：TT<br /><br />证明staic修饰的方法不能被复写。<br /><img src ="http://www.blogjava.net/limiaojian/aggbug/390422.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/limiaojian/" target="_blank">天鹰之翼</a> 2012-10-29 21:48 <a href="http://www.blogjava.net/limiaojian/archive/2012/10/29/390422.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Java中类变量和实例变量的区别</title><link>http://www.blogjava.net/limiaojian/archive/2012/10/28/390369.html</link><dc:creator>天鹰之翼</dc:creator><author>天鹰之翼</author><pubDate>Sun, 28 Oct 2012 13:52:00 GMT</pubDate><guid>http://www.blogjava.net/limiaojian/archive/2012/10/28/390369.html</guid><wfw:comment>http://www.blogjava.net/limiaojian/comments/390369.html</wfw:comment><comments>http://www.blogjava.net/limiaojian/archive/2012/10/28/390369.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/limiaojian/comments/commentRss/390369.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/limiaojian/services/trackbacks/390369.html</trackback:ping><description><![CDATA[<p>类变量也叫静态变量，也就是在变量前加了static 的变量；<br />实例变量也叫对象变量，即没加static 的变量；<br />区别在于：<br />&nbsp;&nbsp;&nbsp; 类变量和实例变量的区别在于：类变量是所有对象共有，其中一个对象将它值改变，其他对象得到的就是改变后的结果；而实例变量则属对象私有，某一个对象将其值改变，不影响其他对象；<br />例：</p><p>class A{<br />&nbsp;&nbsp;&nbsp; static&nbsp; int a = 0; //类变量<br />&nbsp;&nbsp;&nbsp; public int b = 0; //实例变量<br />} </p><p>public class Test{<br />&nbsp;&nbsp;&nbsp; public static void main (String[] args){<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; A a1 = new A();<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; A a2 = new A();<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; a1.a = 3;&nbsp; // 等同于 A.a = 3;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; a1.b = 4 ;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; System.out.println(a2.a); //结果为3<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; //类变量是针对所有对象的，所以a1改变a，a2的a也改变<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; System.out.println(a2.b); //结果为0<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; //实例只改变自身的，所以a1对象的b改变，不影响对象a2的b变量<br />&nbsp;&nbsp;&nbsp; }<br />} </p><img src ="http://www.blogjava.net/limiaojian/aggbug/390369.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/limiaojian/" target="_blank">天鹰之翼</a> 2012-10-28 21:52 <a href="http://www.blogjava.net/limiaojian/archive/2012/10/28/390369.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>