﻿<?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/</link><description /><language>zh-cn</language><lastBuildDate>Wed, 22 Apr 2026 12:59:51 GMT</lastBuildDate><pubDate>Wed, 22 Apr 2026 12:59:51 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>4</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>10</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>十个值得开发者投入的移动应用创意</title><link>http://www.blogjava.net/nokiaguy/archive/2010/12/06/339933.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Mon, 06 Dec 2010 13:41:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2010/12/06/339933.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/339933.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/12/06/339933.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/339933.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/339933.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:     在2010中国移动开发者大会“无线互联应用开发者创业孵化”分论坛中，Frost & Sullivan首席顾问王煜全发表主题为《无线互联的布道与孵化》的演讲，他认为，由于运营商影响力的没落，以及iPhone掀起的热潮，再到 Android市场的崛起，手机操作系统带来了无线互联模式的改变。无线互联产业链正在迅速IT化，开放联机功能平台将是未来格局的奠基者，联机功能平台带来了新的产业链。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/12/06/339933.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/339933.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-12-06 21:41 <a href="http://www.blogjava.net/nokiaguy/archive/2010/12/06/339933.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>乐博Android客户端（新浪微博）1.01发布，欢迎各位童鞋试用</title><link>http://www.blogjava.net/nokiaguy/archive/2010/11/17/338236.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Wed, 17 Nov 2010 03:17:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2010/11/17/338236.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/338236.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/11/17/338236.html#Feedback</comments><slash:comments>7</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/338236.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/338236.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:     乐博Android客户端是一款基于Android的新浪微博客户端。支持同时维护多个新浪微博帐号。可获得新浪微博支持的所有信息。其中包括首页微博、随便看看、我的微博、@提到我的、评论、私信、我的收藏等。发布微博支持拍照、相册、表情、话题等功能。同时可以通过内置的图像特效编辑器编辑拍摄或相册中的图片。特效目前包括马赛克、灰度、裁剪图像、任意角度旋转。除此之外，本系统还提供了两个快捷方式：乐博写写和乐博拍拍。可以将他们放在Android的桌面，分别用于快速写微博和即拍即发。当然，乐博Android客户端还有很多奇妙的功能。这就有待各位童鞋去挖掘了。未来的乐博Android客户端将会加入更具有创造性的功能，让我们共同期待她的完美表现吧！<br>&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/11/17/338236.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/338236.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-17 11:17 <a href="http://www.blogjava.net/nokiaguy/archive/2010/11/17/338236.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>张朝阳：腾讯将抄袭和垄断做到极致</title><link>http://www.blogjava.net/nokiaguy/archive/2010/11/04/337201.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Thu, 04 Nov 2010 02:24:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2010/11/04/337201.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/337201.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2010/11/04/337201.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/337201.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/337201.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: “反观中国，二流的司法只能产生二流的产业，具体地讲，以抄袭和垄断为立公司之本的腾讯将这二者做到极致，创新得不到保护，小公司活不下来，中国的高科技产业面对美国的发达，只能望洋兴叹，作为个体中国人比美国人聪明，但没有好的机制让聪明才智成体系地爆发。”&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2010/11/04/337201.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/337201.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-04 10:24 <a href="http://www.blogjava.net/nokiaguy/archive/2010/11/04/337201.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></channel></rss>