??xml version="1.0" encoding="utf-8" standalone="yes"?>欧美在线3区,精品久久久久久国产91,久青草国产在线http://www.aygfsteel.com/leochiang/zh-cnTue, 17 Jun 2025 04:10:28 GMTTue, 17 Jun 2025 04:10:28 GMT60转:spring ioc原理http://www.aygfsteel.com/leochiang/archive/2012/12/03/392367.htmlleoChiangleoChiangMon, 03 Dec 2012 07:19:00 GMThttp://www.aygfsteel.com/leochiang/archive/2012/12/03/392367.htmlhttp://www.aygfsteel.com/leochiang/comments/392367.htmlhttp://www.aygfsteel.com/leochiang/archive/2012/12/03/392367.html#Feedback0http://www.aygfsteel.com/leochiang/comments/commentRss/392367.htmlhttp://www.aygfsteel.com/leochiang/services/trackbacks/392367.htmlhttp://blog.csdn.net/it_man/article/details/4402245

leoChiang 2012-12-03 15:19 发表评论
]]>
java io ȝhttp://www.aygfsteel.com/leochiang/archive/2012/10/29/390386.htmlleoChiangleoChiangMon, 29 Oct 2012 02:52:00 GMThttp://www.aygfsteel.com/leochiang/archive/2012/10/29/390386.htmlhttp://www.aygfsteel.com/leochiang/comments/390386.htmlhttp://www.aygfsteel.com/leochiang/archive/2012/10/29/390386.html#Feedback0http://www.aygfsteel.com/leochiang/comments/commentRss/390386.htmlhttp://www.aygfsteel.com/leochiang/services/trackbacks/390386.htmlhttp://www.cnblogs.com/oubo/archive/2012/01/06/2394638.html             



leoChiang 2012-10-29 10:52 发表评论
]]>
javacM中的静态方法、非静态代码块{}、静态代码块static{}http://www.aygfsteel.com/leochiang/archive/2012/10/29/390380.htmlleoChiangleoChiangMon, 29 Oct 2012 02:07:00 GMThttp://www.aygfsteel.com/leochiang/archive/2012/10/29/390380.htmlhttp://www.aygfsteel.com/leochiang/comments/390380.htmlhttp://www.aygfsteel.com/leochiang/archive/2012/10/29/390380.html#Feedback0http://www.aygfsteel.com/leochiang/comments/commentRss/390380.htmlhttp://www.aygfsteel.com/leochiang/services/trackbacks/390380.html执行序Q?静态代码段      非静态代码段   构造函?br />而静态方法是被动执行? 在调用的时候执?a >

http://www.cn-java.com/www1/?uid-694384-action-viewspace-itemid-84972





leoChiang 2012-10-29 10:07 发表评论
]]>
快速排?/title><link>http://www.aygfsteel.com/leochiang/archive/2012/10/23/390126.html</link><dc:creator>leoChiang</dc:creator><author>leoChiang</author><pubDate>Tue, 23 Oct 2012 12:58:00 GMT</pubDate><guid>http://www.aygfsteel.com/leochiang/archive/2012/10/23/390126.html</guid><wfw:comment>http://www.aygfsteel.com/leochiang/comments/390126.html</wfw:comment><comments>http://www.aygfsteel.com/leochiang/archive/2012/10/23/390126.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/leochiang/comments/commentRss/390126.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/leochiang/services/trackbacks/390126.html</trackback:ping><description><![CDATA[<div><span style="font-family: Simsun; font-size: 12px; line-height: 18px; text-align: -webkit-left; background-color: #ebebeb; ">分治法的基本思想是:原问题分解q个规模更小但结构与原问题相似的子问题。递归地解q些子问题,然后这些子问题的解l合为原问题的解?br /></span><div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #0000FF; ">package</span> com.thoughtworks;<br /><br /><br /><span style="color: #0000FF; ">public</span> <span style="color: #0000FF; ">class</span> QSort <br />{<br /><br />    <span style="color: #008000; ">/**</span><span style="color: #008000; "><br />     * </span><span style="color: #808080; ">@param</span><span style="color: #008000; "> args<br />     </span><span style="color: #008000; ">*/</span><br />    <span style="color: #0000FF; ">public</span> <span style="color: #0000FF; ">static</span> <span style="color: #0000FF; ">void</span> main(String[] args) <br />    {<br />        <span style="color: #008000; ">//</span><span style="color: #008000; "> TODO 自动生成Ҏ存根</span><span style="color: #008000; "><br /></span>        quicksort qs = <span style="color: #0000FF; ">new</span> quicksort();<br />        <span style="color: #0000FF; ">int</span> data[] = {44,22,2,32,54,22,88,77,99,11};<br />        qs.data = data;<br />        qs.sort(0, qs.data.length-1);<br />        qs.display();<br />    }<br /><br />}<br /><br /><br /><span style="color: #0000FF; ">class</span> quicksort<br />{<br />    <span style="color: #0000FF; ">public</span> <span style="color: #0000FF; ">int</span> data[];<br />    <br />    <span style="color: #0000FF; ">private</span> <span style="color: #0000FF; ">int</span> partition(<span style="color: #0000FF; ">int</span> sortArray[],<span style="color: #0000FF; ">int</span> low,<span style="color: #0000FF; ">int</span> hight)<br />    {<br />        <span style="color: #0000FF; ">int</span> key = sortArray[low];<br />        <br />        <span style="color: #0000FF; ">while</span>(low<hight)<br />        {<br />            <span style="color: #0000FF; ">while</span>(low<hight && sortArray[hight]>=key)<br />                hight--;<br />            sortArray[low] = sortArray[hight];<br />            <br />            <span style="color: #0000FF; ">while</span>(low<hight && sortArray[low]<=key)<br />                low++;<br />            sortArray[hight] = sortArray[low];<br />        }<br />        sortArray[low] = key;<br />        <span style="color: #0000FF; ">return</span> low;<br />    }<br />    <br />    <span style="color: #0000FF; ">public</span> <span style="color: #0000FF; ">void</span> sort(<span style="color: #0000FF; ">int</span> low,<span style="color: #0000FF; ">int</span> hight)<br />    {<br />        <span style="color: #0000FF; ">if</span>(low<hight)<br />        {<br />            <span style="color: #0000FF; ">int</span> result = partition(data,low,hight);<br />            sort(low,result-1);<br />            sort(result+1,hight);<br />        }<br />        <br />    }<br />    <br />    <span style="color: #0000FF; ">public</span> <span style="color: #0000FF; ">void</span> display()<br />    {<br />        <span style="color: #0000FF; ">for</span>(<span style="color: #0000FF; ">int</span> i=0;i<data.length;i++)<br />        {<br />            System.out.print(data[i]);<br />            System.out.print(" ");<br />        }<br />    }<br />}</div><span style="font-family: Simsun; font-size: 12px; line-height: 18px; text-align: -webkit-left; background-color: #ebebeb; "><br /></span><div>2 11 22 22 32 44 54 77 88 99 </div><span style="font-family: Simsun; font-size: 12px; line-height: 18px; text-align: -webkit-left; background-color: #ebebeb; "><br /><br /></span></div><img src ="http://www.aygfsteel.com/leochiang/aggbug/390126.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/leochiang/" target="_blank">leoChiang</a> 2012-10-23 20:58 <a href="http://www.aygfsteel.com/leochiang/archive/2012/10/23/390126.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>aahttp://www.aygfsteel.com/leochiang/archive/2012/10/02/388967.htmlleoChiangleoChiangTue, 02 Oct 2012 13:18:00 GMThttp://www.aygfsteel.com/leochiang/archive/2012/10/02/388967.htmlhttp://www.aygfsteel.com/leochiang/comments/388967.htmlhttp://www.aygfsteel.com/leochiang/archive/2012/10/02/388967.html#Feedback0http://www.aygfsteel.com/leochiang/comments/commentRss/388967.htmlhttp://www.aygfsteel.com/leochiang/services/trackbacks/388967.htmlhttp://robinsoncrusoe.iteye.com/blog/808526 

leoChiang 2012-10-02 21:18 发表评论
]]>
9月笔试和面试ȝhttp://www.aygfsteel.com/leochiang/archive/2012/09/26/388562.htmlleoChiangleoChiangWed, 26 Sep 2012 02:22:00 GMThttp://www.aygfsteel.com/leochiang/archive/2012/09/26/388562.htmlhttp://www.aygfsteel.com/leochiang/comments/388562.htmlhttp://www.aygfsteel.com/leochiang/archive/2012/09/26/388562.html#Feedback0http://www.aygfsteel.com/leochiang/comments/commentRss/388562.htmlhttp://www.aygfsteel.com/leochiang/services/trackbacks/388562.html首先是笔试:   
        1 杄的笔试:  q个公司主要做C和C++Qƈ且熟悉linuxpȝQ这个宣讲会是去玩的Q然后参加了W试。笔试题是英语填词,C部分QC++部分Q题目很基础QC部分做的不错 QC++部分没有?br />        2 优酷土豆的笔试:  W试的时间是90分钟Q然后题目涉及广泛从法 数据l构到v量数据处理,q有一些自己感觉莫名其妙的题目。做的情况嘛 自己没什么信心,当d一下题目回来针对学习(微Y面试100题系列)?br />
其次是面试:

        杄的面试:  面试官通过历对与公司有意义或者他本h有想法的东西Q鉴于公司的研发内容问的我是linux和一些apacheQweb服务器)的内容,q有一些我不曾了解的领域,自动化检(脚本的吧Q)。ȝ下还是^时积累很重要?br />        

        杄  面试的知识点Q?br />           1   apache与tomcat的区别:  
            解析一 
                                       apache支持静态页Q?/span>tomcat支持动态的Q比如servlet{, 一般?/span>apache+tomcat的话Q?/span>apache只是作ؓ一个{发,对jsp的处理是?/span>tomcat来处理的?nbsp;apache可以支持phpcgiperl,但是要用java的话Q你需?/span>tomcat?/span>apache后台支撑Q将javah?/span>apache转发l?/span>tomcat?                                理?nbsp;apache是web服务器,tomcat是应用(javaQ服务器Q它只是一个servlet(jsp也翻译成servlet)容器Q可以认为是apache的扩展,但是可以独立?/span>apacheq行?nbsp;
                               q两个有以下几点可以比较的: 
                            1、两者都?/span>apachel织开发的 
                            2、两者都有HTTP服务的功?nbsp;
                            3、两者都是免费的 
                    不同点: 
                                Apache是专门用了提供HTTP服务的,以及相关配置的(例如虚拟L、URL转发{等Q?nbsp;
                                Tomcat?/span>Apachel织在符合J2EE的JSP、Servlet标准下开发的一个JSP服务?nbsp; 
           解析二: 
                            APACHE是一个web服务器环境程?启用他可以作为web服务器?不过只支持静态网??asp,php,cgi,jsp){动态网늚׃? 如果要在APACHE环境下运行jsp 的话需要一个解释器来执行jsp|页 而这个jsp解释器就?/span>TOMCAT, Z么还要JDK呢?因ؓjsp需要连接数据库的话 pjdk                    来提供连接数据库的驱E,所以要q行jsp的web服务器^台就需?/span>APACHE+TOMCAT+JDK 整合的好处是Q?nbsp;
                        如果客户端请求的是静态页面,则只需?/span>Apache服务器响应请?nbsp;如果客户端请求动态页面,则是Tomcat服务器响应请?nbsp;因ؓjsp是服务器端解释代码的Q这h合就可以减少Tomcat的服务开销 C是一个结构化语言Q如谭老爷子所_它的重点在于法和数据结构。CE序的设计首要考虑?/span>                    ?/span>如何通过一个过E,对输入(或环境条Ӟq行q算处理得到输出Q或实现q程Q事务)控制Q,而对于C++Q首要考虑的是如何构造一个对象模型,让这个模型能够契合与之对应的问题域,q样可以通过获取对象的状态信息得到输出或实现q程Q事务)控制?nbsp;
            解析三: 
                        apache:侧重于http server 
                        tomcat:侧重于servlet引擎Q如果以standalone方式q行Q功能上?/span>apache{效 Q?支持JSPQ但寚w态网不太理惻I 
                        apache是web服务器,tomcat是应用(javaQ服务器Q它只是一个servlet(jsp也翻译成servlet)容器Q可以认为是apache的扩展,但是可以独立?/span>apacheq行?nbsp;
                    换句话说Q?/span>apache是一辆卡车,上面可以装一些东西如html{。但是不能装_要装水必要有容器(ӞQ而这个桶也可以不攑֜卡R上?/span> 
        2 linux基础知识
            linux自启动设|:http://www.xxlinux.com/linux/article/accidence/technique/20070719/9065.html 
             




leoChiang 2012-09-26 10:22 发表评论
]]>
collection框架http://www.aygfsteel.com/leochiang/archive/2012/08/26/386293.htmlleoChiangleoChiangSun, 26 Aug 2012 03:24:00 GMThttp://www.aygfsteel.com/leochiang/archive/2012/08/26/386293.htmlhttp://www.aygfsteel.com/leochiang/comments/386293.htmlhttp://www.aygfsteel.com/leochiang/archive/2012/08/26/386293.html#Feedback0http://www.aygfsteel.com/leochiang/comments/commentRss/386293.htmlhttp://www.aygfsteel.com/leochiang/services/trackbacks/386293.htmlCollection框架

       集合框架(Collection Framework)泛指java.util包的若干个类和接?如Collection,List,ArrayList,LinkedList,Vector(自动增长数组),HashSet,HashMap{? 集合框架中的cM要封装的是典型的数据l构,如动态数l?链表,堆栈,集合,哈希表等.

集合框架cM~程中经常用到的工具c?使得~码q专注于业务层的实现,不需要从底层实现相关l节—“数据l构的封?#8221;?#8221;典型法的实?#8221;.
        http://weipeng2k.iteye.com/blog/286620 
      集合框架的最根基的接?/span>CollectionQ看一下它的声?/span>public interface Collection<E> extends Iterable<E>Q可以看出它l承?/span>IterableQ可q代的)接口Q就相当于说Collection的具体实现类均可以利?/span>Iterator了,q也是集合均支持增强?/span>For循环的原因?br />http://developer.51cto.com/art/200909/149543.htm
Collection框架中实现比较要实现什么接? 
http://www.aygfsteel.com/fastunit/archive/2008/04/08/191533.html 


一个类实现了Camparable接口则表明这个类的对象之间是可以怺比较的,q个cd象组成的集合可以直接用sortҎ排序?/span>
Comparator可以看成一U算法的实现Q将法和数据分,Comparator也可以在下面两种环境下用:
1、类的设计师没有考虑到比较问题而没有实现ComparableQ可以通过Comparator来实现排序而不必改变对象本w?/span>
2、可以用多U排序标准,比如升序、降序等 


ArrayList?/span>Vector都是使用数组方式存储数据Q此数组元素数大于实际存储的数据以便增加和插入元素,它们都允许直接按序号索引元素Q但是插入元素要涉及数组元素Ud{内存操作,所以烦引数据快而插入数据慢Q?/span>Vector׃使用?/span>synchronizedҎQ线E安全)Q通常性能上较ArrayList差,?/span>LinkedList使用双向链表实现存储Q按序号索引数据需要进行前向或后向遍历Q但是插入数据时只需要记录本的前后即可,所以插入速度较快?/span>

 

LinkedList也是U程不安全的Q?/span>LinkedList提供了一些方法,使得LinkedList可以被当作堆栈和队列来用?/span>




 



leoChiang 2012-08-26 11:24 发表评论
]]>
jsp昄当前电脑q行状?/title><link>http://www.aygfsteel.com/leochiang/archive/2012/08/26/386291.html</link><dc:creator>leoChiang</dc:creator><author>leoChiang</author><pubDate>Sun, 26 Aug 2012 03:01:00 GMT</pubDate><guid>http://www.aygfsteel.com/leochiang/archive/2012/08/26/386291.html</guid><wfw:comment>http://www.aygfsteel.com/leochiang/comments/386291.html</wfw:comment><comments>http://www.aygfsteel.com/leochiang/archive/2012/08/26/386291.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/leochiang/comments/commentRss/386291.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/leochiang/services/trackbacks/386291.html</trackback:ping><description><![CDATA[<a href="http://www.aygfsteel.com/DreamAngel/archive/2012/08/24/386227.html">http://www.aygfsteel.com/DreamAngel/archive/2012/08/24/386227.html</a> <img src ="http://www.aygfsteel.com/leochiang/aggbug/386291.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/leochiang/" target="_blank">leoChiang</a> 2012-08-26 11:01 <a href="http://www.aygfsteel.com/leochiang/archive/2012/08/26/386291.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>matlab曲线拟合http://www.aygfsteel.com/leochiang/archive/2012/08/23/386097.htmlleoChiangleoChiangThu, 23 Aug 2012 03:47:00 GMThttp://www.aygfsteel.com/leochiang/archive/2012/08/23/386097.htmlhttp://www.aygfsteel.com/leochiang/comments/386097.htmlhttp://www.aygfsteel.com/leochiang/archive/2012/08/23/386097.html#Feedback0http://www.aygfsteel.com/leochiang/comments/commentRss/386097.htmlhttp://www.aygfsteel.com/leochiang/services/trackbacks/386097.htmlhttp://www.cnblogs.com/fly-height/articles/2414002.html

leoChiang 2012-08-23 11:47 发表评论
]]>
javaU程W试?/title><link>http://www.aygfsteel.com/leochiang/archive/2012/08/18/385747.html</link><dc:creator>leoChiang</dc:creator><author>leoChiang</author><pubDate>Sat, 18 Aug 2012 15:04:00 GMT</pubDate><guid>http://www.aygfsteel.com/leochiang/archive/2012/08/18/385747.html</guid><wfw:comment>http://www.aygfsteel.com/leochiang/comments/385747.html</wfw:comment><comments>http://www.aygfsteel.com/leochiang/archive/2012/08/18/385747.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/leochiang/comments/commentRss/385747.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/leochiang/services/trackbacks/385747.html</trackback:ping><description><![CDATA[W试题:<br />    <span style="font-size:10.5pt; font-family:宋体;Times New Roman";Times New Roman";Times New Roman";">子线E@?/span><span style="font-size:10.5pt;font-family:"Times New Roman","serif";">10</span><span style="font-size:10.5pt;font-family:宋体;Times New Roman";Times New Roman";Times New Roman";">ơ,接着ȝE@?/span><span style="font-size:10.5pt;font-family:"Times New Roman","serif";">100</span><span style="font-size:10.5pt;font-family:宋体;Times New Roman";Times New Roman";Times New Roman";">Q接着又回到子U程循环</span><span style="font-size:10.5pt;font-family:"Times New Roman","serif";">10</span><span style="font-size:10.5pt;font-family:宋体;Times New Roman";Times New Roman";Times New Roman";">ơ,接着再回CU程又@?/span><span style="font-size:10.5pt;font-family:"Times New Roman","serif";">100</span><span style="font-size:10.5pt;font-family:宋体;Times New Roman";Times New Roman";Times New Roman";">Q如此@?/span><span style="font-size: 10.5pt;font-family:"Times New Roman","serif";">50</span><span style="font-size:10.5pt;font-family:宋体;Times New Roman";Times New Roman";Times New Roman";">ơ,请写出程序?br /></span><div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #0000FF; ">package</span> core_java;<br /><br /><span style="color: #0000FF; ">public</span> <span style="color: #0000FF; ">class</span> ThreadTest {<br /><br />    <span style="color: #008000; ">/**</span><span style="color: #008000; "><br />     * </span><span style="color: #808080; ">@param</span><span style="color: #008000; "> args<br />     </span><span style="color: #008000; ">*/</span><br />    <span style="color: #0000FF; ">public</span> <span style="color: #0000FF; ">static</span> <span style="color: #0000FF; ">void</span> main(String[] args) {<br />        <span style="color: #008000; ">//</span><span style="color: #008000; "> TODO Auto-generated method stub</span><span style="color: #008000; "><br /></span>        <span style="color: #0000FF; ">new</span> ThreadTest().init();<br /><br />    }<br /><br />    <span style="color: #0000FF; ">public</span> <span style="color: #0000FF; ">void</span> init()<br />    {<br />        <span style="color: #0000FF; ">final</span> Business business = <span style="color: #0000FF; ">new</span> Business();<br />        <span style="color: #0000FF; ">new</span> Thread(<br />                <span style="color: #0000FF; ">new</span> Runnable()<br />                {<br /><br />                    <span style="color: #0000FF; ">public</span> <span style="color: #0000FF; ">void</span> run() {<br />                        <span style="color: #0000FF; ">for</span>(<span style="color: #0000FF; ">int</span> i=0;i<50;i++)<br />                        {<br />                            business.SubThread(i);<br />                        }                        <br />                    }<br />                    <br />                }<br />        <br />        ).start();<br />        <span style="color: #0000FF; ">for</span>(<span style="color: #0000FF; ">int</span> i=0;i<50;i++)<br />        {<br />            business.MainThread(i);<br />        }        <br />    }<br />    <br />    <span style="color: #0000FF; ">private</span> <span style="color: #0000FF; ">class</span> Business<br />    {<br />        <span style="color: #0000FF; ">boolean</span> bShouldSub = <span style="color: #0000FF; ">true</span>;<span style="color: #008000; ">//</span><span style="color: #008000; ">q里相当于定义了控制该谁执行的一个信L</span><span style="color: #008000; "><br /></span>        <span style="color: #0000FF; ">public</span> <span style="color: #0000FF; ">synchronized</span> <span style="color: #0000FF; ">void</span> MainThread(<span style="color: #0000FF; ">int</span> i)<br />        {<br />            <span style="color: #0000FF; ">if</span>(bShouldSub)<br />                <span style="color: #0000FF; ">try</span> {<br />                    <span style="color: #0000FF; ">this</span>.wait();<br />                } <span style="color: #0000FF; ">catch</span> (InterruptedException e) {<br />                    <span style="color: #008000; ">//</span><span style="color: #008000; "> TODO Auto-generated catch block</span><span style="color: #008000; "><br /></span>                    e.printStackTrace();<br />                }        <br />                <br />            <span style="color: #0000FF; ">for</span>(<span style="color: #0000FF; ">int</span> j=0;j<5;j++)<br />            {<br />                System.out.println(Thread.currentThread().getName() + ":i=" + i +",j=" + j);<br />            }<br />            bShouldSub = <span style="color: #0000FF; ">true</span>;<br />            <span style="color: #0000FF; ">this</span>.notify();<br />        <br />        }<br />        <br />        <br />        <span style="color: #0000FF; ">public</span> <span style="color: #0000FF; ">synchronized</span> <span style="color: #0000FF; ">void</span> SubThread(<span style="color: #0000FF; ">int</span> i)<br />        {<br />            <span style="color: #0000FF; ">if</span>(!bShouldSub)<br />                <span style="color: #0000FF; ">try</span> {<br />                    <span style="color: #0000FF; ">this</span>.wait();<br />                } <span style="color: #0000FF; ">catch</span> (InterruptedException e) {<br />                    <span style="color: #008000; ">//</span><span style="color: #008000; "> TODO Auto-generated catch block</span><span style="color: #008000; "><br /></span>                    e.printStackTrace();<br />                }    <br />                <br />            <span style="color: #0000FF; ">for</span>(<span style="color: #0000FF; ">int</span> j=0;j<10;j++)<br />            {<br />                System.out.println(Thread.currentThread().getName() + ":i=" + i +",j=" + j);<br />            }<br />            bShouldSub = <span style="color: #0000FF; ">false</span>;                <br />            <span style="color: #0000FF; ">this</span>.notify();            <br />        }<br />    }</div><span style="background-color: #eeeeee; font-size: 13px; ">}</span>    <span style="font-size:10.5pt;font-family:宋体;Times New Roman";Times New Roman";Times New Roman";"><br /><br /></span><img src ="http://www.aygfsteel.com/leochiang/aggbug/385747.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/leochiang/" target="_blank">leoChiang</a> 2012-08-18 23:04 <a href="http://www.aygfsteel.com/leochiang/archive/2012/08/18/385747.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss> <footer> <div class="friendship-link"> <a href="http://www.aygfsteel.com/" title="狠狠久久亚洲欧美专区_中文字幕亚洲综合久久202_国产精品亚洲第五区在线_日本免费网站视频">狠狠久久亚洲欧美专区_中文字幕亚洲综合久久202_国产精品亚洲第五区在线_日本免费网站视频</a> </div> </footer> վ֩ģ壺 <a href="http://" target="_blank"></a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank">Ӧñر</a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank">ɽ</a>| <a href="http://" target="_blank">̩</a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank">Ȫ</a>| <a href="http://" target="_blank">̨</a>| <a href="http://" target="_blank">ٲ</a>| <a href="http://" target="_blank">ɽ</a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank">ն</a>| <a href="http://" target="_blank">ˮ</a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank">IJ</a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank">ϴ</a>| <a href="http://" target="_blank">½</a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank">ƽ</a>| <a href="http://" target="_blank">ɽ</a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank">ͨ</a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank">Ѩ</a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank"></a>| <a href="http://" target="_blank">ɽ</a>| <script> (function(){ var bp = document.createElement('script'); var curProtocol = window.location.protocol.split(':')[0]; if (curProtocol === 'https') { bp.src = 'https://zz.bdstatic.com/linksubmit/push.js'; } else { bp.src = 'http://push.zhanzhang.baidu.com/push.js'; } var s = document.getElementsByTagName("script")[0]; s.parentNode.insertBefore(bp, s); })(); </script> </body>