﻿<?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/nokiaguy/category/31725.html</link><description /><language>zh-cn</language><lastBuildDate>Sun, 03 Nov 2013 10:18:44 GMT</lastBuildDate><pubDate>Sun, 03 Nov 2013 10:18:44 GMT</pubDate><ttl>60</ttl><item><title>Twitter算法面试题详解（Java实现）</title><link>http://www.blogjava.net/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.blogjava.net/nokiaguy/archive/2013/11/03/405944.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/405944.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2013/11/03/405944.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/405944.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/405944.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 最近在网上看到一道Twitter的算法面试题，网上已经有人给出了答案，不过可能有些人没太看明白（我也未验证是否正确），现在给出一个比较好理解的答案。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2013/11/03/405944.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/405944.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2013-11-03 18:03 <a href="http://www.blogjava.net/nokiaguy/archive/2013/11/03/405944.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>百度面试题：求绝对值最小的数</title><link>http://www.blogjava.net/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.blogjava.net/nokiaguy/archive/2013/01/30/394920.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/394920.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2013/01/30/394920.html#Feedback</comments><slash:comments>6</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/394920.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/394920.html</trackback:ping><description><![CDATA[<p>&nbsp;&nbsp;&nbsp; 有一个已经排序的数组（升序），数组中可能有正数、负数或0，求数组中元素的绝对值最小的数，要求，不能用顺序比较的方法（复杂度需要小于O（n）），可以使用任何语言实现</p>
<p>例如，数组{-20，-13，-4, 6, 77,200} ，绝对值最小的是-4。</p>
<p>&nbsp;</p>
<p>&nbsp;&nbsp;&nbsp; 算法实现的基本思路</p>
<p>找到负数和正数的分界点，如果正好是0就是它了，如果是正数，再和左面相邻的负数绝对值比较，如果是负数，取取绝对值与右面正数比较。还要考虑数组只有正数或负数的情况。</p>
<p>我根据这个思路用Java简单实现了一个算法。<span style="color: #ff0000;">大家有更好的实现方法欢迎跟帖</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; ">&nbsp;</span><span style="color: #0000FF; ">class</span><span style="color: #000000; ">&nbsp;MinAbsoluteValue<br />{<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">private</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">static</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;getMinAbsoluteValue(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[]&nbsp;source)<br />&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;index&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;result&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;startIndex&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;endIndex&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;source.length&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;&nbsp;计算负数和正数分界点</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">true</span><span style="color: #000000; ">)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{</span><span style="color: #000000; "></span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; </span><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;&nbsp;计算当前的索引</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;index&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;startIndex&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;(endIndex&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">&nbsp;startIndex)&nbsp;</span><span style="color: #000000; ">/</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">2</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;result&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;source[index];</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">br</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;&nbsp;如果等于0，就直接返回了，0肯定是绝对值最小的</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</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 />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}</span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; </span><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;&nbsp;如果值大于0，处理当前位置左侧区域，因为负数肯定在左侧</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">else</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(result&nbsp;</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(index&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">break</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</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; ">]&nbsp;</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;endIndex&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;index&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">else</span><span style="color: #000000; ">&nbsp;</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; ">]&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">break</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}</span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; </span><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;&nbsp;如果小于0，处理当前位置右侧的区域，因为正数肯定在右侧的位置</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(index&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;endIndex)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">break</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(source[index&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">1</span><span style="color: #000000; ">]&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;startIndex&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;index&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">else</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(source[index&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">1</span><span style="color: #000000; ">]&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">break</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;&nbsp;根据分界点计算绝对值最小的数</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(source[index]&nbsp;</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(index&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">||</span><span style="color: #000000; ">&nbsp;source[index]&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;Math.abs(source[index</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">]))<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;result</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;source[index];<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;result&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;source[index</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">];<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(index&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;source.length&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">1</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">||</span><span style="color: #000000; ">&nbsp;Math.abs(source[index])&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;source[index</span><span style="color: #000000; ">+</span><span style="color: #000000; ">1</span><span style="color: #000000; ">])<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;result</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;source[index];<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;result&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;source[index</span><span style="color: #000000; ">+</span><span style="color: #000000; ">1</span><span style="color: #000000; ">];<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;result;<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">public</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">static</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">void</span><span style="color: #000000; ">&nbsp;main(String[]&nbsp;args)&nbsp;</span><span style="color: #0000FF; ">throws</span><span style="color: #000000; ">&nbsp;Exception<br />&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[]&nbsp;arr1&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">new</span><span style="color: #000000; ">&nbsp;</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 />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[]&nbsp;arr2&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">new</span><span style="color: #000000; ">&nbsp;</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 />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[]&nbsp;arr3&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">new</span><span style="color: #000000; ">&nbsp;</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 />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;value&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;getMinAbsoluteValue(arr1);<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;System.out.println(value);<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;value&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;getMinAbsoluteValue(arr2);<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;System.out.println(value);<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;value&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;getMinAbsoluteValue(arr3);<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;System.out.println(value);<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br />}</span></div><img src ="http://www.blogjava.net/nokiaguy/aggbug/394920.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2013-01-30 11:45 <a href="http://www.blogjava.net/nokiaguy/archive/2013/01/30/394920.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Android深度探索（卷1）：安装C/C++交叉编译环境</title><link>http://www.blogjava.net/nokiaguy/archive/2013/01/28/394850.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Mon, 28 Jan 2013 15:28:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2013/01/28/394850.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/394850.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2013/01/28/394850.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/394850.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/394850.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 在Ubuntu Linux上安装可编译成ARM架构的交叉编译环境CodeSourcery，编译完的执行文件可在Android手机上直接运行。本文阐述了如何下载、安装和使用CodeSourcery。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2013/01/28/394850.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/394850.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2013-01-28 23:28 <a href="http://www.blogjava.net/nokiaguy/archive/2013/01/28/394850.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Android开发（1）：随机绘制彩色实心圆</title><link>http://www.blogjava.net/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.blogjava.net/nokiaguy/archive/2011/09/06/358115.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/358115.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2011/09/06/358115.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/358115.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/358115.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 本文介绍了如何利用Android的绘图技术随机绘制彩色实心圆。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2011/09/06/358115.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/358115.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2011-09-06 16:06 <a href="http://www.blogjava.net/nokiaguy/archive/2011/09/06/358115.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>赶紧升级到Android 2.3.4，体验最新的Android技术 </title><link>http://www.blogjava.net/nokiaguy/archive/2011/04/29/349299.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Fri, 29 Apr 2011 14:20:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2011/04/29/349299.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/349299.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2011/04/29/349299.html#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/349299.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/349299.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 使用Google的二儿子（Nexus S）的童鞋赶紧了，Android 2.3.4已经出来了（虽然官方文档暂时还没更新，可能出来还不到24小时），如果已经是android 2.3.1，必须升级到Android 2.3.3后才能升级到2.3.4&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2011/04/29/349299.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/349299.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2011-04-29 22:20 <a href="http://www.blogjava.net/nokiaguy/archive/2011/04/29/349299.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>关于Android中传递数据的一些讨论</title><link>http://www.blogjava.net/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.blogjava.net/nokiaguy/archive/2010/11/09/337636.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/337636.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/11/09/337636.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/337636.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/337636.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 虽然Intent和静态变量都可以传递数据，但intent功能有限，static过于wrong，那么有没有一种更好的方式呢，答案是yes，这就是Application Context，一个全局的Context，详情请读者参见本文的内容。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/11/09/337636.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/337636.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-11-09 16:25 <a href="http://www.blogjava.net/nokiaguy/archive/2010/11/09/337636.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《Android/OPhone 开发完全讲义》连载（10）：Sqlite数据库</title><link>http://www.blogjava.net/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.blogjava.net/nokiaguy/archive/2010/10/28/336413.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/336413.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/10/28/336413.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/336413.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/336413.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 现在终于到讲解数据库的时间了。数据库也是Android存储方案的核心。在Android系统中使用了Sqlite数据库。Sqlite是非常轻量的数据库。从Sqlite的标志是一根羽毛就可以看出Sqlite的目标就是无论是过去、现在，还是将来，Sqlite都将以轻量级数据库的姿态出现。Sqlite虽然轻量，但在执行某些简单的SQL语句时甚至比MySQL和Postgresql还快。由于很多读者是第一次接触Sqlite数据库，因此，在介绍如何在Android中使用Sqlite之前，先在本节简单介绍一下如何在PC上建立Sqlite数据库，以及Sqlite数据库的一些特殊方面（由于本书的目的不是介绍Sqlite数据库，因此，与其他数据库类似的部分（如insert、update等）本书将不再介绍。没有掌握这些知识的读者可以参阅其他关于数据库方面的书籍。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/10/28/336413.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/336413.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-10-28 22:16 <a href="http://www.blogjava.net/nokiaguy/archive/2010/10/28/336413.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《Android/OPhone开发完全讲义》连载（8)：收到短信了，我该做点什么？</title><link>http://www.blogjava.net/nokiaguy/archive/2010/09/13/331909.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Mon, 13 Sep 2010 08:59:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2010/09/13/331909.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/331909.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/09/13/331909.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/331909.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/331909.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 短信是手机中经常使用到的一种服务。然而，当手机接收到短信时，也会向系统发送广播。如果我们的应用程序要在手机接收到短信后做点什么，那就需要接收这个系统广播。<br>接收系统广播的步骤我们已经熟悉了，下面就按步就班地来完成这两个步骤。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/09/13/331909.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/331909.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-09-13 16:59 <a href="http://www.blogjava.net/nokiaguy/archive/2010/09/13/331909.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《Android/OPhone开发完全讲义》连载（7)：使用SharedPreferences存取复杂数据</title><link>http://www.blogjava.net/nokiaguy/archive/2010/09/08/331371.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Wed, 08 Sep 2010 01:49:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2010/09/08/331371.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/331371.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/09/08/331371.html#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/331371.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/331371.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:   我们知道SharedPreferences只能保存简单类型的数据，例如，String、int等。如果想用SharedPreferences存取更复杂的数据类型（类、图像等），就需要对这些数据进行编码。我们通常会将复杂类型的数据转换成Base64编码，然后将转换后的数据以字符串的形式保存在 XML文件中。<br>&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/09/08/331371.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/331371.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-09-08 09:49 <a href="http://www.blogjava.net/nokiaguy/archive/2010/09/08/331371.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>中国移动开发者社区专访：学习Android的两大法宝</title><link>http://www.blogjava.net/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.blogjava.net/nokiaguy/archive/2010/08/25/329842.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/329842.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/08/25/329842.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/329842.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/329842.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 最近Android比较火，无论是摩托罗拉搭载 Android 2.2准备咸鱼翻身，还是Android Market年底将在台湾开市……这些消息足以让人们为之振奋。但当人们看到Android的外表光鲜之时，更要注意到其潜在内涵，尤其对于广大开发者，一味盲目地崇拜并扎入其中并不实为理智之举。本期，我们为您邀请到一位与代码打了15年交道的李宁，以其亲身经历和开发经验来为广大开发者提出鉴言和忠告。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/08/25/329842.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/329842.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-08-25 05:45 <a href="http://www.blogjava.net/nokiaguy/archive/2010/08/25/329842.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>可循环显示图像的Android Gallery组件</title><link>http://www.blogjava.net/nokiaguy/archive/2010/08/23/329721.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Mon, 23 Aug 2010 15:44:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2010/08/23/329721.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/329721.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/08/23/329721.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/329721.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/329721.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: Gallery组件主要用于横向显示图像列表，不过按常规做法。Gallery组件只能有限地显示指定的图像。也就是说，如果为Gallery组件指定了10张图像，那么当Gallery组件显示到第10张时，就不会再继续显示了。这虽然在大多数时候没有什么关系，但在某些情况下，我们希望图像显示到最后一张时再重第1张开始显示，也就是循环显示。要实现这种风格的Gallery组件，就需要对Gallery的Adapter对象进行一番改进。<br>&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/08/23/329721.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/329721.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-08-23 23:44 <a href="http://www.blogjava.net/nokiaguy/archive/2010/08/23/329721.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>移动互联网的新宠：Android之缤纷世界</title><link>http://www.blogjava.net/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.blogjava.net/nokiaguy/archive/2010/08/17/329090.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/329090.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/08/17/329090.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/329090.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/329090.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:   Android这个词已强占我们的眼球有一段时间了。在此之前，提到Android，没人会和移动互联网以及Google这两个当今最火辣的词联系起来。然而，自从Google推出自己的移动操作系统Android以来，Android、Google和移动互联网就好像10年前的Windows、微软和PC操作系统一样，成为了当今最吸引眼球的组合。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/08/17/329090.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/329090.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-08-17 12:14 <a href="http://www.blogjava.net/nokiaguy/archive/2010/08/17/329090.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>ophonesdn对首位优秀版主mobileguy的专访</title><link>http://www.blogjava.net/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.blogjava.net/nokiaguy/archive/2010/08/09/328303.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/328303.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/08/09/328303.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/328303.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/328303.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 东北大学计算机专业硕士。CSDN博客专家、51CTO客座专家、中国移动开发者社区技术管理员、OPhone专家、 ophonesdn版主（Id:mobileguy）、eoeandroid版主（id:androidguy）。曾任东软股份项目经理。曾领导并参与开发了十几个大中型项目。从2005年进入写作领域以来， 为程序员、电脑编程技巧与维护、电脑报、IT168、天极网等平面媒体和网络媒体撰写了一百多篇原创技术和评论文章。并在个人 blog（http://nokiaguy.blogjava.net）上发表了大量的原创技术文章。 &nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/08/09/328303.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/328303.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-08-09 12:19 <a href="http://www.blogjava.net/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.blogjava.net/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.blogjava.net/nokiaguy/archive/2010/08/06/328160.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/328160.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/08/06/328160.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/328160.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/328160.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 自从去年从OPhone征文大赛得了部Dell Mini 3i手机后，一直没时间研究。最近抽了时间想研究下OPhone，结果是想当另人郁闷。Dell Mini 3i原来的系统是OPhone 1.0，相当于Android 1.1。这个版本虽然没有什么大问题，但问题是现在很多软件都是基于OPhone/Android 1.5及以上版本的。而基于OPhone 1.0或Android 1.1的软件是少之又少，没办法，除了自己写的软件，大多数软件都无法安装，最后没办法，不得不去维修点把系统升了下级，变成了OPhone 1.5。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/08/06/328160.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/328160.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-08-06 18:42 <a href="http://www.blogjava.net/nokiaguy/archive/2010/08/06/328160.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《人人都玩开心网：Ext JS+Android+SSH整合开发Web与移动SNS》销售排名第4，发篇ExtJS的文章(拖放树结点)庆祝下</title><link>http://www.blogjava.net/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.blogjava.net/nokiaguy/archive/2010/08/03/327815.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/327815.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/08/03/327815.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/327815.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/327815.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 《人人都玩开心网：Ext JS+Android+SSH整合开发Web与移动SNS》一书上架短短几天，就进入了互动网计算机类销售总排名第4的好成绩。现发篇Ext JS的技术文章庆祝下。在本文将介绍TreePanel组件非常有意思的一个功能：结点拖放。要使TreePanel组件的结点可以拖放非常简单，只需要将TreePanel类的enableDD选项参数设为true即可。当然，要想实现更复杂的功能，还需要配合其他的参数和事件。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/08/03/327815.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/327815.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-08-03 14:15 <a href="http://www.blogjava.net/nokiaguy/archive/2010/08/03/327815.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>实现基于Android的英文电子词典</title><link>http://www.blogjava.net/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.blogjava.net/nokiaguy/archive/2010/07/31/327623.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/327623.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/07/31/327623.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/327623.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/327623.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:  英文词典是手机中经常使用的应用。因此，在本文将结合Android来讨论如何实现一个<br>Android版的英文词典。实现英文词典的方法很多。在本文使用了SQLite数据库来保存英文单词信息。系统通过SQLite数据库中保存的单词信息来查找到与指定英文对应的中文信息。当然，实现这样一个英文词典需要解决一系列技术问题。例如，如何将保存英文单词信息的数据库文件随程序（apk文件）一起发布；发布后如何打开数据库；如何在输入前几个字母后，在AutoCompleteTextView组件提示列表中显示以所输入字符串开头的所有单词。在本章将逐渐给出这些问题的详细答案。<br>&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/07/31/327623.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/327623.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-07-31 10:29 <a href="http://www.blogjava.net/nokiaguy/archive/2010/07/31/327623.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>不使用中间变量交换两个数（Java版）</title><link>http://www.blogjava.net/nokiaguy/archive/2010/07/28/327291.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Wed, 28 Jul 2010 02:29:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2010/07/28/327291.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/327291.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/07/28/327291.html#Feedback</comments><slash:comments>8</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/327291.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/327291.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 在程序中实现交换两个数的功能并不复杂，但如果不使用中间变量，就需要动一下脑筋。在本文介绍了两个方法（其实原理都是一个）。其基本原理就是数的中和。也就是说，通过某种运算（二元运算）将a和b两个数变成一个数，并保存在其中一个变量中。然后再通过同样的运算符将a或b中和掉。这样实际上是利用了a或 b本身作为了中间变量。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/07/28/327291.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/327291.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-07-28 10:29 <a href="http://www.blogjava.net/nokiaguy/archive/2010/07/28/327291.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Android系统原理与源码分析（1）：利用Java反射技术阻止通过按钮关闭对话框</title><link>http://www.blogjava.net/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.blogjava.net/nokiaguy/archive/2010/07/27/327270.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/327270.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/07/27/327270.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/327270.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/327270.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 众所周知，AlertDialog类用于显示对话框。关于AlertDialog的基本用法在这里就不详细介绍了，网上有很多，读者可以自己搜索。那么本文要介绍的是如何随心所欲地控制AlertDialog。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/07/27/327270.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/327270.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-07-27 23:05 <a href="http://www.blogjava.net/nokiaguy/archive/2010/07/27/327270.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《人人都玩开心网：Ext JS+Android+SSH整合开发Web与移动SNS》样章下载</title><link>http://www.blogjava.net/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.blogjava.net/nokiaguy/archive/2010/07/24/327003.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/327003.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/07/24/327003.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/327003.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/327003.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 第1章：开发梦缘起开心网<br><br>第5章：开心桌面：完全模拟Windows桌面的开心网<br><br>第15章：移动电子相册：捕捉精彩瞬间<br>&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/07/24/327003.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/327003.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-07-24 11:30 <a href="http://www.blogjava.net/nokiaguy/archive/2010/07/24/327003.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Android软件出新招 不再只盯着应用商店</title><link>http://www.blogjava.net/nokiaguy/archive/2010/07/16/326302.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Fri, 16 Jul 2010 06:16:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2010/07/16/326302.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/326302.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/07/16/326302.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/326302.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/326302.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:     使用智能手机，PC端的手机管理软件是不可或缺的工具。最近，一款名为豌豆荚手机精灵的管理工具悄然发布beta版。用户把手机和电脑连接上后，可以通过这款软件在电脑上方便地管理手机中的通讯录、短信、应用程序和音乐等，或者备份重要资料。产品负责人王俊煜认为豌豆荚手机精灵自我定位为的应该是 “全功能的Android手机管理软件”。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/07/16/326302.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/326302.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-07-16 14:16 <a href="http://www.blogjava.net/nokiaguy/archive/2010/07/16/326302.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《Android/OPhone开发完全讲义》连载（6）：为TextView组件加上边框</title><link>http://www.blogjava.net/nokiaguy/archive/2010/07/15/326166.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Thu, 15 Jul 2010 02:37:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2010/07/15/326166.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/326166.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/07/15/326166.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/326166.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/326166.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 《Android/OPhone 开发完全讲义》目前计算机类销售总排名：互动网（china-pub）第3名，当当网新书热卖榜销售总排名第4名。<br>Android系统本身提供的TextView组件并不支持边框，但可以对TextView进行扩展来添加边框。我们可以使用如下两种方法为TextView组件添加边框。<br>1.  编写一个继承TextView类的自定义组件，并在onDraw事件方法中画边框。<br>2.  使用9-patch格式的图像作为TextView的背景图来设置边框（这个背景图需要带一个边框）。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/07/15/326166.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/326166.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-07-15 10:37 <a href="http://www.blogjava.net/nokiaguy/archive/2010/07/15/326166.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《Android/OPhone开发完全讲义》连载（5）：Notification与状态栏信息</title><link>http://www.blogjava.net/nokiaguy/archive/2010/07/13/325920.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Tue, 13 Jul 2010 00:20:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2010/07/13/325920.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/325920.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/07/13/325920.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/325920.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/325920.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:  Notification与Toast都可以起到通知、提醒的作用。但它们的实现原理和表现形式却完全不一样。Toast其实相当于一个组件（Widget）。有些类似于没有按钮的对话框。而Notification是显示在屏幕上方状态栏中的信息。还有就是Notification需要用NotificationManager来管理，而Toast只需要简单地创建Toast对象即可。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/07/13/325920.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/325920.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-07-13 08:20 <a href="http://www.blogjava.net/nokiaguy/archive/2010/07/13/325920.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《Android/OPhone开发完全讲义》连载（4）：Android SDK中常用命令行工具（二） </title><link>http://www.blogjava.net/nokiaguy/archive/2010/07/08/325591.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Thu, 08 Jul 2010 12:58:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2010/07/08/325591.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/325591.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/07/08/325591.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/325591.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/325591.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 一、 PC与模拟器或真机交换文件（adb pull和adb push）<br>二、 Shell命令<br>三、创建、删除和浏览AVD设备（android）&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/07/08/325591.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/325591.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-07-08 20:58 <a href="http://www.blogjava.net/nokiaguy/archive/2010/07/08/325591.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>新书内容连载（3）：Android SDK中常用命令行工具（一）</title><link>http://www.blogjava.net/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.blogjava.net/nokiaguy/archive/2010/07/05/325277.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/325277.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/07/05/325277.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/325277.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/325277.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:     经作者测试，模拟器在运行一段时间后，adb服务有可能（在Windows进程中可找到这个服务，该服务用来为模拟器或通过USB数据线连接的真机服务）会出现异常。这时需要重新对adb服务关闭和重启。当然，重启Eclipse可能会解决问题。但那比较麻烦。如果想手工关闭adb服务，可以使用下面的命令。<br><br>adb kill-server<br><br>在关闭adb服务后，要使用如下的命令启动adb服务。<br><br>adb start-server<br>&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/07/05/325277.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/325277.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-07-05 14:02 <a href="http://www.blogjava.net/nokiaguy/archive/2010/07/05/325277.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《Android/OPhone 开发完全讲义》已出版，现提供源代码下载</title><link>http://www.blogjava.net/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.blogjava.net/nokiaguy/archive/2010/07/01/324979.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/324979.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/07/01/324979.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/324979.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/324979.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 《Android/OPhone 开发完全讲义》已出版。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/07/01/324979.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/324979.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-07-01 13:43 <a href="http://www.blogjava.net/nokiaguy/archive/2010/07/01/324979.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Google 菜市场（Android Market）上不去的解决方法</title><link>http://www.blogjava.net/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.blogjava.net/nokiaguy/archive/2010/06/15/323610.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/323610.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/06/15/323610.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/323610.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/323610.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:     最近几天，突然手机（我的是G3，估计其他android手机也有类似的情况）上不了android market了，甚至连gmail也出现网络问题（通过gprs、3g和wifi都不好使）。一开始还以为是手机的问题，后经过多次重启，刷机，还是存在 问题。最后经过验证，google更改了服务设置，相关服务（包括android market）已成了限制服务（原因吗，大家都知道，这里就不说了），但还是有办法解决地。首先下载下面的zip文件。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/06/15/323610.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/323610.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-06-15 13:20 <a href="http://www.blogjava.net/nokiaguy/archive/2010/06/15/323610.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《Android/OPhone 开发完全讲义》样章和目录下载</title><link>http://www.blogjava.net/nokiaguy/archive/2010/06/02/322547.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Wed, 02 Jun 2010 06:00:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2010/06/02/322547.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/322547.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/06/02/322547.html#Feedback</comments><slash:comments>20</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/322547.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/322547.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 《Android/OPhone 开发完全讲义》一书预计在6-15左右出版，现提供3个样章（第1、8和14章）试读，欢迎提出宝贵意见。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/06/02/322547.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/322547.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-06-02 14:00 <a href="http://www.blogjava.net/nokiaguy/archive/2010/06/02/322547.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《Android/OPhone开发完全讲义》最新封面，欢迎提出宝贵建议</title><link>http://www.blogjava.net/nokiaguy/archive/2010/05/31/322379.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Mon, 31 May 2010 10:52:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2010/05/31/322379.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/322379.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/05/31/322379.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/322379.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/322379.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 经过编辑的努力，新的封面终于出来了。书将在6-15之前上市。先展示下封面和封底，欢迎提出宝贵意见。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/05/31/322379.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/322379.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-05-31 18:52 <a href="http://www.blogjava.net/nokiaguy/archive/2010/05/31/322379.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>新书《Android/OPhone开发完全讲义》即将出版，看看哪个封面更好</title><link>http://www.blogjava.net/nokiaguy/archive/2010/05/26/321951.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Wed, 26 May 2010 12:47:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2010/05/26/321951.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/321951.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/05/26/321951.html#Feedback</comments><slash:comments>12</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/321951.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/321951.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 新书《Android/OPhone开发完全讲义》将在6月份出版，现在三个候选封面效果。各位看看哪个封面更好些。<br>&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/05/26/321951.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/321951.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-05-26 20:47 <a href="http://www.blogjava.net/nokiaguy/archive/2010/05/26/321951.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>有道难题2009复赛题解答（Java版）：求大于给定数的最小不重复数</title><link>http://www.blogjava.net/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.blogjava.net/nokiaguy/archive/2010/05/11/320597.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/320597.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/05/11/320597.html#Feedback</comments><slash:comments>21</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/320597.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/320597.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 最近看了有道出的几个复赛题，觉得很好玩，现给出Java版的答案。先看看提干部分。如果一个数字十进制表达时，不存在连续两位数字相等，则称之为“不重复数”。例如，105，1234和12121都是“不重复数”，而11，100和 1225不算。给定一个long类型数字A，返回大于A的最小“不重复数”。 &nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/05/11/320597.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/320597.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2010-05-11 16:23 <a href="http://www.blogjava.net/nokiaguy/archive/2010/05/11/320597.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>