??xml version="1.0" encoding="utf-8" standalone="yes"?>www.youjizz.com在线,神马久久精品,亚洲午夜精品一区 二区 三区http://www.aygfsteel.com/nokiaguy/category/31725.htmlzh-cnSun, 03 Nov 2013 10:18:44 GMTSun, 03 Nov 2013 10:18:44 GMT60Twitter法面试题详解(Java实现Q?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2013/11/03/405944.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Sun, 03 Nov 2013 10:03:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2013/11/03/405944.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/405944.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2013/11/03/405944.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/405944.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/405944.html</trackback:ping><description><![CDATA[     摘要: 最q在|上看到一道Twitter的算法面试题Q网上已l有人给Z{案Q不q可能有些h没太看明白(我也未验证是否正)Q现在给Z个比较好理解的答案?nbsp; <a href='http://www.aygfsteel.com/nokiaguy/archive/2013/11/03/405944.html'>阅读全文</a><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/405944.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2013-11-03 18:03 <a href="http://www.aygfsteel.com/nokiaguy/archive/2013/11/03/405944.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>癑ֺ面试题:求绝对值最的?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2013/01/30/394920.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Wed, 30 Jan 2013 03:45:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2013/01/30/394920.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/394920.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2013/01/30/394920.html#Feedback</comments><slash:comments>6</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/394920.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/394920.html</trackback:ping><description><![CDATA[<p>    有一个已l排序的数组Q升序)Q数l中可能有正数、负数或0Q求数组中元素的l对值最的敎ͼ要求Q不能用序比较的方法(复杂度需要小于OQnQ)Q可以用Q何语a实现</p> <p>例如Q数l{-20Q?13Q?4, 6, 77,200} Q绝对值最的?4?/p> <p> </p> <p>    法实现的基本思\</p> <p>扑ֈ负数和正数的分界点,如果正好?是它了Q如果是正数Q再和左面相?c)负数l对值比较,如果是负敎ͼ取取l对g右面正数比较。还要考虑数组只有正数或负数的情况?/p> <p>我根据这个思\用Java单实C一个算法?span style="color: #ff0000;">大家有更好的实现Ҏ(gu)Ƣ迎跟帖</span></p><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; ">public</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">class</span><span style="color: #000000; "> MinAbsoluteValue<br />{<br />    </span><span style="color: #0000FF; ">private</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">static</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> getMinAbsoluteValue(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[] source)<br />    {<br />         <br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> index </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> result </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">; <br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> startIndex </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> endIndex </span><span style="color: #000000; ">=</span><span style="color: #000000; "> source.length </span><span style="color: #000000; ">-</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />        </span><span style="color: #008000; ">//</span><span style="color: #008000; ">  计算负数和正数分界点</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">        </span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">true</span><span style="color: #000000; ">)<br />        {</span><span style="color: #000000; "></span><span style="color: #000000; ">                </span><span style="color: #008000; ">//</span><span style="color: #008000; ">  计算当前的烦?/span><span style="color: #008000; "><br /></span><span style="color: #000000; ">            index </span><span style="color: #000000; ">=</span><span style="color: #000000; "> startIndex </span><span style="color: #000000; ">+</span><span style="color: #000000; "> (endIndex </span><span style="color: #000000; ">-</span><span style="color: #000000; "> startIndex) </span><span style="color: #000000; ">/</span><span style="color: #000000; "> </span><span style="color: #000000; ">2</span><span style="color: #000000; ">;<br />            result </span><span style="color: #000000; ">=</span><span style="color: #000000; "> source[index];</span><span style="color: #000000; "><</span><span style="color: #000000; ">br</span><span style="color: #000000; ">></span><span style="color: #000000; ">                </span><span style="color: #008000; ">//</span><span style="color: #008000; ">  如果{于0Q就直接q回了,0肯定是绝对值最的</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">            </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(result</span><span style="color: #000000; ">==</span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />            {<br />                </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />            }</span><span style="color: #000000; ">               </span><span style="color: #008000; ">//</span><span style="color: #008000; ">  如果值大?Q处理当前位|左侧区域,因ؓ负数肯定在左?/span><span style="color: #008000; "><br /></span><span style="color: #000000; ">            </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(result </span><span style="color: #000000; ">></span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />            {<br />                </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(index </span><span style="color: #000000; ">==</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />                {<br />                    </span><span style="color: #0000FF; ">break</span><span style="color: #000000; ">;<br />                }<br />                </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(source[index</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">] </span><span style="color: #000000; ">></span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />                    endIndex </span><span style="color: #000000; ">=</span><span style="color: #000000; "> index </span><span style="color: #000000; ">-</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />                </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(source[index</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">] </span><span style="color: #000000; ">==</span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />                    </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />                </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />                    </span><span style="color: #0000FF; ">break</span><span style="color: #000000; ">;<br />            }</span><span style="color: #000000; ">            </span><span style="color: #008000; ">//</span><span style="color: #008000; ">  如果于0Q处理当前位|右侧的区域Q因为正数肯定在右侧的位|?/span><span style="color: #008000; "><br /></span><span style="color: #000000; ">            </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />            {<br />                </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(index </span><span style="color: #000000; ">==</span><span style="color: #000000; "> endIndex)<br />                    </span><span style="color: #0000FF; ">break</span><span style="color: #000000; ">;<br />                </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(source[index </span><span style="color: #000000; ">+</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">] </span><span style="color: #000000; "><</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />                    startIndex </span><span style="color: #000000; ">=</span><span style="color: #000000; "> index </span><span style="color: #000000; ">+</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />                </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(source[index </span><span style="color: #000000; ">+</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">] </span><span style="color: #000000; ">==</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />                    </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />                </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />                    </span><span style="color: #0000FF; ">break</span><span style="color: #000000; ">;<br />            }<br />        }<br />        </span><span style="color: #008000; ">//</span><span style="color: #008000; ">  Ҏ(gu)分界点计绝对值最的?/span><span style="color: #008000; "><br /></span><span style="color: #000000; ">        </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(source[index] </span><span style="color: #000000; ">></span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />        {<br />            </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(index </span><span style="color: #000000; ">==</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; "> </span><span style="color: #000000; ">||</span><span style="color: #000000; "> source[index] </span><span style="color: #000000; "><</span><span style="color: #000000; "> Math.abs(source[index</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">]))<br />                result</span><span style="color: #000000; ">=</span><span style="color: #000000; "> source[index];<br />            </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />                result </span><span style="color: #000000; ">=</span><span style="color: #000000; "> source[index</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">];<br />        }<br />        </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />        {<br />            </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(index </span><span style="color: #000000; ">==</span><span style="color: #000000; "> source.length </span><span style="color: #000000; ">-</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; "> </span><span style="color: #000000; ">||</span><span style="color: #000000; "> Math.abs(source[index]) </span><span style="color: #000000; "><</span><span style="color: #000000; "> source[index</span><span style="color: #000000; ">+</span><span style="color: #000000; ">1</span><span style="color: #000000; ">])<br />                result</span><span style="color: #000000; ">=</span><span style="color: #000000; "> source[index];<br />            </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />                result </span><span style="color: #000000; ">=</span><span style="color: #000000; "> source[index</span><span style="color: #000000; ">+</span><span style="color: #000000; ">1</span><span style="color: #000000; ">];<br />        }<br />         <br />         <br />        </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> result;<br />    }<br />    </span><span style="color: #0000FF; ">public</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">static</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">void</span><span style="color: #000000; "> main(String[] args) </span><span style="color: #0000FF; ">throws</span><span style="color: #000000; "> Exception<br />    {<br />         <br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[] arr1 </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">new</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[]{</span><span style="color: #000000; ">-</span><span style="color: #000000; ">23</span><span style="color: #000000; ">,</span><span style="color: #000000; ">-</span><span style="color: #000000; ">22</span><span style="color: #000000; ">,</span><span style="color: #000000; ">-</span><span style="color: #000000; ">3</span><span style="color: #000000; ">,</span><span style="color: #000000; ">-</span><span style="color: #000000; ">2</span><span style="color: #000000; ">,</span><span style="color: #000000; ">1</span><span style="color: #000000; ">,</span><span style="color: #000000; ">2</span><span style="color: #000000; ">,</span><span style="color: #000000; ">3</span><span style="color: #000000; ">,</span><span style="color: #000000; ">5</span><span style="color: #000000; ">,</span><span style="color: #000000; ">20</span><span style="color: #000000; ">,</span><span style="color: #000000; ">120</span><span style="color: #000000; ">};<br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[] arr2 </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">new</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[]{</span><span style="color: #000000; ">-</span><span style="color: #000000; ">23</span><span style="color: #000000; ">,</span><span style="color: #000000; ">-</span><span style="color: #000000; ">22</span><span style="color: #000000; ">,</span><span style="color: #000000; ">-</span><span style="color: #000000; ">12</span><span style="color: #000000; ">,</span><span style="color: #000000; ">-</span><span style="color: #000000; ">6</span><span style="color: #000000; ">,</span><span style="color: #000000; ">-</span><span style="color: #000000; ">4</span><span style="color: #000000; ">};<br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[] arr3 </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">new</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[]{</span><span style="color: #000000; ">1</span><span style="color: #000000; ">,</span><span style="color: #000000; ">22</span><span style="color: #000000; ">,</span><span style="color: #000000; ">33</span><span style="color: #000000; ">,</span><span style="color: #000000; ">55</span><span style="color: #000000; ">,</span><span style="color: #000000; ">66</span><span style="color: #000000; ">,</span><span style="color: #000000; ">333</span><span style="color: #000000; ">};<br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> value </span><span style="color: #000000; ">=</span><span style="color: #000000; "> getMinAbsoluteValue(arr1);<br />        System.out.println(value);<br />        value </span><span style="color: #000000; ">=</span><span style="color: #000000; "> getMinAbsoluteValue(arr2);<br />        System.out.println(value);<br />        value </span><span style="color: #000000; ">=</span><span style="color: #000000; "> getMinAbsoluteValue(arr3);<br />        System.out.println(value);<br />    }<br />}</span></div><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/394920.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2013-01-30 11:45 <a href="http://www.aygfsteel.com/nokiaguy/archive/2013/01/30/394920.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Android深度探烦Q卷1Q:安装C/C++交叉~译环境http://www.aygfsteel.com/nokiaguy/archive/2013/01/28/394850.html银河使?/dc:creator>银河使?/author>Mon, 28 Jan 2013 15:28:00 GMThttp://www.aygfsteel.com/nokiaguy/archive/2013/01/28/394850.htmlhttp://www.aygfsteel.com/nokiaguy/comments/394850.htmlhttp://www.aygfsteel.com/nokiaguy/archive/2013/01/28/394850.html#Feedback0http://www.aygfsteel.com/nokiaguy/comments/commentRss/394850.htmlhttp://www.aygfsteel.com/nokiaguy/services/trackbacks/394850.html阅读全文

]]>
Android开发(1Q:随机l制彩色实心?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2011/09/06/358115.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Tue, 06 Sep 2011 08:06:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2011/09/06/358115.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/358115.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2011/09/06/358115.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/358115.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/358115.html</trackback:ping><description><![CDATA[     摘要: 本文介绍了如何利用Android的绘图技术随机绘制彩色实心圆?nbsp; <a href='http://www.aygfsteel.com/nokiaguy/archive/2011/09/06/358115.html'>阅读全文</a><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/358115.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2011-09-06 16:06 <a href="http://www.aygfsteel.com/nokiaguy/archive/2011/09/06/358115.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>赶紧升到Android 2.3.4Q体验最新的Android技?http://www.aygfsteel.com/nokiaguy/archive/2011/04/29/349299.html银河使?/dc:creator>银河使?/author>Fri, 29 Apr 2011 14:20:00 GMThttp://www.aygfsteel.com/nokiaguy/archive/2011/04/29/349299.htmlhttp://www.aygfsteel.com/nokiaguy/comments/349299.htmlhttp://www.aygfsteel.com/nokiaguy/archive/2011/04/29/349299.html#Feedback5http://www.aygfsteel.com/nokiaguy/comments/commentRss/349299.htmlhttp://www.aygfsteel.com/nokiaguy/services/trackbacks/349299.html阅读全文

]]>
关于Android中传递数据的一些讨?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2010/11/09/337636.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Tue, 09 Nov 2010 08:25:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2010/11/09/337636.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/337636.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2010/11/09/337636.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/337636.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/337636.html</trackback:ping><description><![CDATA[     摘要: 虽然Intent和静态变量都可以传递数据,但intent功能有限Qstaticq于wrongQ那么有没有一U更好的方式呢,{案是yesQ这是Application ContextQ一个全局的ContextQ详情请读者参见本文的内容?nbsp; <a href='http://www.aygfsteel.com/nokiaguy/archive/2010/11/09/337636.html'>阅读全文</a><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/337636.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2010-11-09 16:25 <a href="http://www.aygfsteel.com/nokiaguy/archive/2010/11/09/337636.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《Android/OPhone 开发完全讲义》连载(10Q:Sqlite数据?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2010/10/28/336413.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Thu, 28 Oct 2010 14:16:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2010/10/28/336413.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/336413.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2010/10/28/336413.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/336413.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/336413.html</trackback:ping><description><![CDATA[     摘要: 现在l于到讲解数据库的时间了。数据库也是Android存储Ҏ(gu)的核心。在Androidpȝ中用了Sqlite数据库。Sqlite是非常轻量的数据库。从Sqlite的标志是一根羽毛就可以看出Sqlite的目标就是无论是q去、现在,q是来QSqlite都将以轻量数据库的姿态出现。Sqlite虽然轻量Q但在执行某些简单的SQL语句时甚xMySQL和Postgresqlq快。由于很多读者是W一ơ接触Sqlite数据库,因此Q在介绍如何在Android中用Sqlite之前Q先在本节简单介l一下如何在PC上徏立Sqlite数据库,以及Sqlite数据库的一些特D方面(׃本书的目的不是介lSqlite数据库,因此Q与其他数据库类似的部分Q如insert、update{)本书不再介l。没有掌握这些知识的读者可以参阅其他关于数据库斚w的书c?nbsp; <a href='http://www.aygfsteel.com/nokiaguy/archive/2010/10/28/336413.html'>阅读全文</a><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/336413.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2010-10-28 22:16 <a href="http://www.aygfsteel.com/nokiaguy/archive/2010/10/28/336413.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《Android/OPhone开发完全讲义》连载(8)Q收到短信了Q我该做点什么?http://www.aygfsteel.com/nokiaguy/archive/2010/09/13/331909.html银河使?/dc:creator>银河使?/author>Mon, 13 Sep 2010 08:59:00 GMThttp://www.aygfsteel.com/nokiaguy/archive/2010/09/13/331909.htmlhttp://www.aygfsteel.com/nokiaguy/comments/331909.htmlhttp://www.aygfsteel.com/nokiaguy/archive/2010/09/13/331909.html#Feedback1http://www.aygfsteel.com/nokiaguy/comments/commentRss/331909.htmlhttp://www.aygfsteel.com/nokiaguy/services/trackbacks/331909.html接收pȝq播的步骤我们已l熟(zhn)了Q下面就按步q地来完成q两个步骤?nbsp; 阅读全文

]]>
《Android/OPhone开发完全讲义》连载(7)Q用SharedPreferences存取复杂数据http://www.aygfsteel.com/nokiaguy/archive/2010/09/08/331371.html银河使?/dc:creator>银河使?/author>Wed, 08 Sep 2010 01:49:00 GMThttp://www.aygfsteel.com/nokiaguy/archive/2010/09/08/331371.htmlhttp://www.aygfsteel.com/nokiaguy/comments/331371.htmlhttp://www.aygfsteel.com/nokiaguy/archive/2010/09/08/331371.html#Feedback5http://www.aygfsteel.com/nokiaguy/comments/commentRss/331371.htmlhttp://www.aygfsteel.com/nokiaguy/services/trackbacks/331371.html  阅读全文

]]>
中国Ud开发者社Z访:学习Android的两大法?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2010/08/25/329842.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Tue, 24 Aug 2010 21:45:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2010/08/25/329842.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/329842.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2010/08/25/329842.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/329842.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/329842.html</trackback:ping><description><![CDATA[     摘要: 最qAndroid比较火,无论是摩托罗拉搭?Android 2.2准备咔RnQ还是Android Marketq底在台湾开市……这些消息以让ZZ振奋。但当h们看到Android的外表光鲜之Ӟ更要注意到其潜在内涵Q尤其对于广大开发者,一味盲目地崇拜q扎入其中ƈ不实为理Z举。本期,我们为?zhn)邀请到一位与代码打了15q交道的李宁Q以其亲w经历和开发经验来为广大开发者提出鉴a和忠告?nbsp; <a href='http://www.aygfsteel.com/nokiaguy/archive/2010/08/25/329842.html'>阅读全文</a><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/329842.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2010-08-25 05:45 <a href="http://www.aygfsteel.com/nokiaguy/archive/2010/08/25/329842.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>可@环显C图像的Android Gallerylghttp://www.aygfsteel.com/nokiaguy/archive/2010/08/23/329721.html银河使?/dc:creator>银河使?/author>Mon, 23 Aug 2010 15:44:00 GMThttp://www.aygfsteel.com/nokiaguy/archive/2010/08/23/329721.htmlhttp://www.aygfsteel.com/nokiaguy/comments/329721.htmlhttp://www.aygfsteel.com/nokiaguy/archive/2010/08/23/329721.html#Feedback0http://www.aygfsteel.com/nokiaguy/comments/commentRss/329721.htmlhttp://www.aygfsteel.com/nokiaguy/services/trackbacks/329721.html  阅读全文

]]>
Ud互联|的新宠QAndroid之缤U世?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2010/08/17/329090.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Tue, 17 Aug 2010 04:14:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2010/08/17/329090.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/329090.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2010/08/17/329090.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/329090.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/329090.html</trackback:ping><description><![CDATA[     摘要: Androidq个词已强占我们的眼球有一D|间了。在此之前,提到AndroidQ没Z和移动互联网以及Googleq两个当今最火G的词联系h。然而,自从Google推出自己的移动操作系lAndroid以来QAndroid、Google和移动互联网好?0q前的Windows、微软和PC操作pȝ一P成ؓ了当今最吸引眼球的组合?nbsp; <a href='http://www.aygfsteel.com/nokiaguy/archive/2010/08/17/329090.html'>阅读全文</a><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/329090.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2010-08-17 12:14 <a href="http://www.aygfsteel.com/nokiaguy/archive/2010/08/17/329090.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>ophonesdn寚w位优U版主mobileguy的专?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2010/08/09/328303.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Mon, 09 Aug 2010 04:19:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2010/08/09/328303.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/328303.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2010/08/09/328303.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/328303.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/328303.html</trackback:ping><description><![CDATA[     摘要: 东北大学计算Z业硕士。CSDN博客专家?1CTO客专家、中国移动开发者社区技术管理员、OPhone专家?ophonesdn版主QId:mobileguyQ、eoeandroid版主Qid:androidguyQ。曾M软股份项目经理。曾领导q参与开发了十几个大中型目。从2005q进入写作领域以来, 为程序员、电(sh)脑编E技巧与l护、电(sh)脑报、IT168、天极网{^面媒体和|络媒体撰写了一癑֤原创技术和评论文章。ƈ在个?blogQhttp://nokiaguy.blogjava.netQ上发表了大量的原创技术文章?  <a href='http://www.aygfsteel.com/nokiaguy/archive/2010/08/09/328303.html'>阅读全文</a><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/328303.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2010-08-09 12:19 <a href="http://www.aygfsteel.com/nokiaguy/archive/2010/08/09/328303.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>OPhone1.0升到OPhone1.5的超爽体?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2010/08/06/328160.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Fri, 06 Aug 2010 10:42:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2010/08/06/328160.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/328160.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2010/08/06/328160.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/328160.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/328160.html</trackback:ping><description><![CDATA[     摘要: 自从d从OPhone征文大赛得了部Dell Mini 3i手机后,一直没旉研究。最q抽了时间想研究下OPhoneQ结果是惛_另h郁闷。Dell Mini 3i原来的系l是OPhone 1.0Q相当于Android 1.1。这个版本虽然没有什么大问题Q但问题是现在很多Y仉是基于OPhone/Android 1.5及以上版本的。而基于OPhone 1.0或Android 1.1的Y件是之又少Q没办法Q除了自己写的YӞ大多数Y仉无法安装Q最后没办法Q不得不ȝ修点把系l升了下U,变成了OPhone 1.5?nbsp; <a href='http://www.aygfsteel.com/nokiaguy/archive/2010/08/06/328160.html'>阅读全文</a><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/328160.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2010-08-06 18:42 <a href="http://www.aygfsteel.com/nokiaguy/archive/2010/08/06/328160.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《h人都玩开心网QExt JS+Android+SSH整合开发Web与移动SNS》销售排名第4Q发ExtJS的文?拖放树结?庆祝?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2010/08/03/327815.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Tue, 03 Aug 2010 06:15:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2010/08/03/327815.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/327815.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2010/08/03/327815.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/327815.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/327815.html</trackback:ping><description><![CDATA[     摘要: 《h人都玩开心网QExt JS+Android+SSH整合开发Web与移动SNS》一书上架短短几天,p入了互动|计机c销售L名第4的好成W。现发篇Ext JS的技术文章庆下。在本文介lTreePanellg非常有意思的一个功能:l点拖放。要使TreePanellg的结点可以拖N常简单,只需要将TreePanelcȝenableDD选项参数设ؓtrue卛_。当Ӟ要想实现更复杂的功能Q还需要配合其他的参数和事件?nbsp; <a href='http://www.aygfsteel.com/nokiaguy/archive/2010/08/03/327815.html'>阅读全文</a><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/327815.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2010-08-03 14:15 <a href="http://www.aygfsteel.com/nokiaguy/archive/2010/08/03/327815.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>实现ZAndroid的英文电(sh)子词?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2010/07/31/327623.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Sat, 31 Jul 2010 02:29:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2010/07/31/327623.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/327623.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2010/07/31/327623.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/327623.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/327623.html</trackback:ping><description><![CDATA[     摘要: 英文词典是手Zl常使用的应用。因此,在本文将l合Android来讨论如何实C?<br>Android版的英文词典。实现英文词典的Ҏ(gu)很多。在本文使用了SQLite数据库来保存英文单词信息。系l通过SQLite数据库中保存的单词信息来查找C指定英文对应的中文信息。当Ӟ实现q样一个英文词兔R要解决一pd技术问题。例如,如何保存英文单词信息的数据库文仉E序Qapk文gQ一起发布;发布后如何打开数据库;如何在输入前几个字母后,在AutoCompleteTextViewlg提示列表中显CZ所输入字符串开头的所有单词。在本章逐渐l出q些问题的详l答案?<br>  <a href='http://www.aygfsteel.com/nokiaguy/archive/2010/07/31/327623.html'>阅读全文</a><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/327623.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2010-07-31 10:29 <a href="http://www.aygfsteel.com/nokiaguy/archive/2010/07/31/327623.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>不用中间变量交换两个数QJava版)http://www.aygfsteel.com/nokiaguy/archive/2010/07/28/327291.html银河使?/dc:creator>银河使?/author>Wed, 28 Jul 2010 02:29:00 GMThttp://www.aygfsteel.com/nokiaguy/archive/2010/07/28/327291.htmlhttp://www.aygfsteel.com/nokiaguy/comments/327291.htmlhttp://www.aygfsteel.com/nokiaguy/archive/2010/07/28/327291.html#Feedback8http://www.aygfsteel.com/nokiaguy/comments/commentRss/327291.htmlhttp://www.aygfsteel.com/nokiaguy/services/trackbacks/327291.html阅读全文

]]>
Androidpȝ原理与源码分析(1Q:利用Java反射技术阻止通过按钮关闭对话?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2010/07/27/327270.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Tue, 27 Jul 2010 15:05:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2010/07/27/327270.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/327270.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2010/07/27/327270.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/327270.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/327270.html</trackback:ping><description><![CDATA[     摘要: 众所周知QAlertDialogcȝ于显C对话框。关于AlertDialog的基本用法在q里׃详细介绍了,|上有很多,读者可以自己搜索。那么本文要介绍的是如何随心所Ʋ地控制AlertDialog?nbsp; <a href='http://www.aygfsteel.com/nokiaguy/archive/2010/07/27/327270.html'>阅读全文</a><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/327270.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2010-07-27 23:05 <a href="http://www.aygfsteel.com/nokiaguy/archive/2010/07/27/327270.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《h人都玩开心网QExt JS+Android+SSH整合开发Web与移动SNS》样章下?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2010/07/24/327003.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Sat, 24 Jul 2010 03:30:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2010/07/24/327003.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/327003.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2010/07/24/327003.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/327003.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/327003.html</trackback:ping><description><![CDATA[     摘要: W?章:开发梦~v开心网 <br> <br>W?章:开心桌面:完全模拟Windows桌面的开心网 <br> <br>W?5章:Ud?sh)子相册Q捕捉精彩瞬?<br>  <a href='http://www.aygfsteel.com/nokiaguy/archive/2010/07/24/327003.html'>阅读全文</a><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/327003.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2010-07-24 11:30 <a href="http://www.aygfsteel.com/nokiaguy/archive/2010/07/24/327003.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Android软g出新?不再只盯着应用商店http://www.aygfsteel.com/nokiaguy/archive/2010/07/16/326302.html银河使?/dc:creator>银河使?/author>Fri, 16 Jul 2010 06:16:00 GMThttp://www.aygfsteel.com/nokiaguy/archive/2010/07/16/326302.htmlhttp://www.aygfsteel.com/nokiaguy/comments/326302.htmlhttp://www.aygfsteel.com/nokiaguy/archive/2010/07/16/326302.html#Feedback0http://www.aygfsteel.com/nokiaguy/comments/commentRss/326302.htmlhttp://www.aygfsteel.com/nokiaguy/services/trackbacks/326302.html阅读全文

]]>
《Android/OPhone开发完全讲义》连载(6Q:为TextViewlg加上Ҏ(gu)http://www.aygfsteel.com/nokiaguy/archive/2010/07/15/326166.html银河使?/dc:creator>银河使?/author>Thu, 15 Jul 2010 02:37:00 GMThttp://www.aygfsteel.com/nokiaguy/archive/2010/07/15/326166.htmlhttp://www.aygfsteel.com/nokiaguy/comments/326166.htmlhttp://www.aygfsteel.com/nokiaguy/archive/2010/07/15/326166.html#Feedback0http://www.aygfsteel.com/nokiaguy/comments/commentRss/326166.htmlhttp://www.aygfsteel.com/nokiaguy/services/trackbacks/326166.htmlAndroidpȝ本n提供的TextViewlgq不支持Ҏ(gu)Q但可以对TextViewq行扩展来添加边框。我们可以用如下两U方法ؓTextViewlgdҎ(gu)?
1. ~写一个承TextViewcȝ自定义组Ӟq在onDraw事gҎ(gu)中画Ҏ(gu)?
2. 使用9-patch格式的图像作为TextView的背景图来设|边框(q个背景N要带一个边框)?nbsp; 阅读全文

]]>
《Android/OPhone开发完全讲义》连载(5Q:Notification与状态栏信息http://www.aygfsteel.com/nokiaguy/archive/2010/07/13/325920.html银河使?/dc:creator>银河使?/author>Tue, 13 Jul 2010 00:20:00 GMThttp://www.aygfsteel.com/nokiaguy/archive/2010/07/13/325920.htmlhttp://www.aygfsteel.com/nokiaguy/comments/325920.htmlhttp://www.aygfsteel.com/nokiaguy/archive/2010/07/13/325920.html#Feedback0http://www.aygfsteel.com/nokiaguy/comments/commentRss/325920.htmlhttp://www.aygfsteel.com/nokiaguy/services/trackbacks/325920.html阅读全文

]]>
《Android/OPhone开发完全讲义》连载(4Q:Android SDK中常用命令行工具Q二Q?http://www.aygfsteel.com/nokiaguy/archive/2010/07/08/325591.html银河使?/dc:creator>银河使?/author>Thu, 08 Jul 2010 12:58:00 GMThttp://www.aygfsteel.com/nokiaguy/archive/2010/07/08/325591.htmlhttp://www.aygfsteel.com/nokiaguy/comments/325591.htmlhttp://www.aygfsteel.com/nokiaguy/archive/2010/07/08/325591.html#Feedback0http://www.aygfsteel.com/nokiaguy/comments/commentRss/325591.htmlhttp://www.aygfsteel.com/nokiaguy/services/trackbacks/325591.html二?Shell命o
三、创建、删除和览AVD讑֤QandroidQ?nbsp; 阅读全文

]]>
C内容q蝲Q?Q:Android SDK中常用命令行工具Q一Q?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2010/07/05/325277.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Mon, 05 Jul 2010 06:02:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2010/07/05/325277.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/325277.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2010/07/05/325277.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/325277.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/325277.html</trackback:ping><description><![CDATA[     摘要: l作者测试,模拟器在q行一D|间后Qadb服务有可能(在Windowsq程中可扑ֈq个服务Q该服务用来为模拟器或通过USB数据U连接的真机服务Q会出现异常。这旉要重新对adb服务关闭和重启。当Ӟ重启Eclipse可能会解决问题。但那比较麻烦。如果想手工关闭adb服务Q可以用下面的命o?<br> <br>adb kill-server <br> <br>在关闭adb服务后,要用如下的命o启动adb服务?<br> <br>adb start-server <br>  <a href='http://www.aygfsteel.com/nokiaguy/archive/2010/07/05/325277.html'>阅读全文</a><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/325277.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2010-07-05 14:02 <a href="http://www.aygfsteel.com/nokiaguy/archive/2010/07/05/325277.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《Android/OPhone 开发完全讲义》已出版Q现提供源代码下?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2010/07/01/324979.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Thu, 01 Jul 2010 05:43:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2010/07/01/324979.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/324979.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2010/07/01/324979.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/324979.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/324979.html</trackback:ping><description><![CDATA[     摘要: 《Android/OPhone 开发完全讲义》已出版?nbsp; <a href='http://www.aygfsteel.com/nokiaguy/archive/2010/07/01/324979.html'>阅读全文</a><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/324979.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2010-07-01 13:43 <a href="http://www.aygfsteel.com/nokiaguy/archive/2010/07/01/324979.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Google 菜市场(Android MarketQ上不去的解x?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2010/06/15/323610.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Tue, 15 Jun 2010 05:20:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2010/06/15/323610.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/323610.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2010/06/15/323610.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/323610.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/323610.html</trackback:ping><description><![CDATA[     摘要: 最q几天,H然手机Q我的是G3Q估计其他android手机也有cM的情况)上不了android market了,甚至qgmail也出现网l问题(通过gprs?g和wifi都不好Q。一开始还以ؓ是手机的问题Q后l过多次重启Q刷机,q是存在 问题。最后经q验证,google更改了服务设|,相关服务Q包括android marketQ已成了限制服务Q原因吗Q大安知道Q这里就不说了)Q但q是有办法解军_。首先下载下面的zip文g?nbsp; <a href='http://www.aygfsteel.com/nokiaguy/archive/2010/06/15/323610.html'>阅读全文</a><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/323610.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2010-06-15 13:20 <a href="http://www.aygfsteel.com/nokiaguy/archive/2010/06/15/323610.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《Android/OPhone 开发完全讲义》样章和目录下蝲http://www.aygfsteel.com/nokiaguy/archive/2010/06/02/322547.html银河使?/dc:creator>银河使?/author>Wed, 02 Jun 2010 06:00:00 GMThttp://www.aygfsteel.com/nokiaguy/archive/2010/06/02/322547.htmlhttp://www.aygfsteel.com/nokiaguy/comments/322547.htmlhttp://www.aygfsteel.com/nokiaguy/archive/2010/06/02/322547.html#Feedback20http://www.aygfsteel.com/nokiaguy/comments/commentRss/322547.htmlhttp://www.aygfsteel.com/nokiaguy/services/trackbacks/322547.html阅读全文

]]>
《Android/OPhone开发完全讲义》最新封面,Ƣ迎提出宝贵http://www.aygfsteel.com/nokiaguy/archive/2010/05/31/322379.html银河使?/dc:creator>银河使?/author>Mon, 31 May 2010 10:52:00 GMThttp://www.aygfsteel.com/nokiaguy/archive/2010/05/31/322379.htmlhttp://www.aygfsteel.com/nokiaguy/comments/322379.htmlhttp://www.aygfsteel.com/nokiaguy/archive/2010/05/31/322379.html#Feedback2http://www.aygfsteel.com/nokiaguy/comments/commentRss/322379.htmlhttp://www.aygfsteel.com/nokiaguy/services/trackbacks/322379.html阅读全文

]]>
C《Android/OPhone开发完全讲义》即出版,看看哪个面更好http://www.aygfsteel.com/nokiaguy/archive/2010/05/26/321951.html银河使?/dc:creator>银河使?/author>Wed, 26 May 2010 12:47:00 GMThttp://www.aygfsteel.com/nokiaguy/archive/2010/05/26/321951.htmlhttp://www.aygfsteel.com/nokiaguy/comments/321951.htmlhttp://www.aygfsteel.com/nokiaguy/archive/2010/05/26/321951.html#Feedback12http://www.aygfsteel.com/nokiaguy/comments/commentRss/321951.htmlhttp://www.aygfsteel.com/nokiaguy/services/trackbacks/321951.html  阅读全文

]]>
有道N2009复赛题解{(Java版)Q求大于l定数的最不重复?/title><link>http://www.aygfsteel.com/nokiaguy/archive/2010/05/11/320597.html</link><dc:creator>银河使?/dc:creator><author>银河使?/author><pubDate>Tue, 11 May 2010 08:23:00 GMT</pubDate><guid>http://www.aygfsteel.com/nokiaguy/archive/2010/05/11/320597.html</guid><wfw:comment>http://www.aygfsteel.com/nokiaguy/comments/320597.html</wfw:comment><comments>http://www.aygfsteel.com/nokiaguy/archive/2010/05/11/320597.html#Feedback</comments><slash:comments>21</slash:comments><wfw:commentRss>http://www.aygfsteel.com/nokiaguy/comments/commentRss/320597.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/nokiaguy/services/trackbacks/320597.html</trackback:ping><description><![CDATA[     摘要: 最q看了有道出的几个复赛题Q觉得很好玩Q现l出Java版的{案。先看看提干部分。如果一个数字十q制表达Ӟ不存在连l两位数字相{,则称之ؓ“不重复数”。例如,105Q?234?2121都是“不重复数”,?1Q?00?1225不算。给定一个longcd数字AQ返回大于A的最“不重复数”?  <a href='http://www.aygfsteel.com/nokiaguy/archive/2010/05/11/320597.html'>阅读全文</a><img src ="http://www.aygfsteel.com/nokiaguy/aggbug/320597.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/nokiaguy/" target="_blank">银河使?/a> 2010-05-11 16:23 <a href="http://www.aygfsteel.com/nokiaguy/archive/2010/05/11/320597.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"></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>