�??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.dentisthealthcenter.com/nokiaguy/</link><description /><language>zh-cn</language><lastBuildDate>Thu, 07 Dec 2023 16:32:34 GMT</lastBuildDate><pubDate>Thu, 07 Dec 2023 16:32:34 GMT</pubDate><ttl>60</ttl><item><title>Twitter���法面试题详解（Java实现�Q?/title><link>http://www.dentisthealthcenter.com/nokiaguy/archive/2013/11/03/405944.html</link><dc:creator>银河使�?/dc:creator><author>银河使�?/author><pubDate>Sun, 03 Nov 2013 10:03:00 GMT</pubDate><guid>http://www.dentisthealthcenter.com/nokiaguy/archive/2013/11/03/405944.html</guid><wfw:comment>http://www.dentisthealthcenter.com/nokiaguy/comments/405944.html</wfw:comment><comments>http://www.dentisthealthcenter.com/nokiaguy/archive/2013/11/03/405944.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://www.dentisthealthcenter.com/nokiaguy/comments/commentRss/405944.html</wfw:commentRss><trackback:ping>http://www.dentisthealthcenter.com/nokiaguy/services/trackbacks/405944.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 最�q�在�|�上看到一道Twitter的算法面试题�Q�网上已�l�有人给��Z���{�案�Q�不�q�可能有些�h没太看明白（我也未验证是否正���）�Q�现在给��Z��个比较好理解的答案�?nbsp;&nbsp;<a href='http://www.dentisthealthcenter.com/nokiaguy/archive/2013/11/03/405944.html'>阅读全文</a><img src ="http://www.dentisthealthcenter.com/nokiaguy/aggbug/405944.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.dentisthealthcenter.com/nokiaguy/" target="_blank">银河使�?/a> 2013-11-03 18:03 <a href="http://www.dentisthealthcenter.com/nokiaguy/archive/2013/11/03/405944.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>癑ֺ�面试题：求绝对值最���的�?/title><link>http://www.dentisthealthcenter.com/nokiaguy/archive/2013/01/30/394920.html</link><dc:creator>银河使�?/dc:creator><author>银河使�?/author><pubDate>Wed, 30 Jan 2013 03:45:00 GMT</pubDate><guid>http://www.dentisthealthcenter.com/nokiaguy/archive/2013/01/30/394920.html</guid><wfw:comment>http://www.dentisthealthcenter.com/nokiaguy/comments/394920.html</wfw:comment><comments>http://www.dentisthealthcenter.com/nokiaguy/archive/2013/01/30/394920.html#Feedback</comments><slash:comments>10</slash:comments><wfw:commentRss>http://www.dentisthealthcenter.com/nokiaguy/comments/commentRss/394920.html</wfw:commentRss><trackback:ping>http://www.dentisthealthcenter.com/nokiaguy/services/trackbacks/394920.html</trackback:ping><description><![CDATA[<p>&nbsp;&nbsp;&nbsp; 有一个已�l�排序的数组�Q�升序）�Q�数�l�中可能有正数、负数或0�Q�求数组中元素的�l�对值最���的敎ͼ�要求�Q�不能用��序比较的方法（复杂度需要小于O�Q�n�Q�）�Q�可以��用�Q何语�a�实现</p>
<p>例如�Q�数�l�{-20�Q?13�Q?4, 6, 77,200} �Q�绝对值最���的�?4�?/p>
<p>&nbsp;</p>
<p>&nbsp;&nbsp;&nbsp; ���法实现的基本思�\</p>
<p>扑ֈ�负数和正数的分界点，如果正好�?���是它了�Q�如果是正数�Q�再和左面相�ȝ��负数�l�对值比较，如果是负敎ͼ�取取�l�对��g��右面正数比较。还要考虑数组只有正数或负数的情况�?/p>
<p>我根据这个思�\用Java���单实��C��一个算法�?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�Q�就直接�q�回了，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;如果值大�?�Q�处理当前位�|�左侧区域，因�ؓ负数肯定在左�?/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�Q�处理当前位�|�右侧的区域�Q�因为正数肯定在右侧的位�|?/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.dentisthealthcenter.com/nokiaguy/aggbug/394920.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.dentisthealthcenter.com/nokiaguy/" target="_blank">银河使�?/a> 2013-01-30 11:45 <a href="http://www.dentisthealthcenter.com/nokiaguy/archive/2013/01/30/394920.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Android深度探烦�Q�卷1�Q�：安装C/C++交叉�~�译环境</title><link>http://www.dentisthealthcenter.com/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.dentisthealthcenter.com/nokiaguy/archive/2013/01/28/394850.html</guid><wfw:comment>http://www.dentisthealthcenter.com/nokiaguy/comments/394850.html</wfw:comment><comments>http://www.dentisthealthcenter.com/nokiaguy/archive/2013/01/28/394850.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.dentisthealthcenter.com/nokiaguy/comments/commentRss/394850.html</wfw:commentRss><trackback:ping>http://www.dentisthealthcenter.com/nokiaguy/services/trackbacks/394850.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 在Ubuntu Linux上安装可�~�译成ARM架构的交叉编译环境CodeSourcery�Q�编译完的执行文件可在Android手机上直接运行。本文阐�q�C��如何下蝲、安装和使用CodeSourcery�?nbsp;&nbsp;<a href='http://www.dentisthealthcenter.com/nokiaguy/archive/2013/01/28/394850.html'>阅读全文</a><img src ="http://www.dentisthealthcenter.com/nokiaguy/aggbug/394850.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.dentisthealthcenter.com/nokiaguy/" target="_blank">银河使�?/a> 2013-01-28 23:28 <a href="http://www.dentisthealthcenter.com/nokiaguy/archive/2013/01/28/394850.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Android开发（1�Q�：随机�l�制彩色实心�?/title><link>http://www.dentisthealthcenter.com/nokiaguy/archive/2011/09/06/358115.html</link><dc:creator>银河使�?/dc:creator><author>银河使�?/author><pubDate>Tue, 06 Sep 2011 08:06:00 GMT</pubDate><guid>http://www.dentisthealthcenter.com/nokiaguy/archive/2011/09/06/358115.html</guid><wfw:comment>http://www.dentisthealthcenter.com/nokiaguy/comments/358115.html</wfw:comment><comments>http://www.dentisthealthcenter.com/nokiaguy/archive/2011/09/06/358115.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.dentisthealthcenter.com/nokiaguy/comments/commentRss/358115.html</wfw:commentRss><trackback:ping>http://www.dentisthealthcenter.com/nokiaguy/services/trackbacks/358115.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 本文介绍了如何利用Android的绘图技术随机绘制彩色实心圆�?nbsp;&nbsp;<a href='http://www.dentisthealthcenter.com/nokiaguy/archive/2011/09/06/358115.html'>阅读全文</a><img src ="http://www.dentisthealthcenter.com/nokiaguy/aggbug/358115.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.dentisthealthcenter.com/nokiaguy/" target="_blank">银河使�?/a> 2011-09-06 16:06 <a href="http://www.dentisthealthcenter.com/nokiaguy/archive/2011/09/06/358115.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>赶紧升��到Android 2.3.4�Q�体验最新的Android技�?</title><link>http://www.dentisthealthcenter.com/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.dentisthealthcenter.com/nokiaguy/archive/2011/04/29/349299.html</guid><wfw:comment>http://www.dentisthealthcenter.com/nokiaguy/comments/349299.html</wfw:comment><comments>http://www.dentisthealthcenter.com/nokiaguy/archive/2011/04/29/349299.html#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://www.dentisthealthcenter.com/nokiaguy/comments/commentRss/349299.html</wfw:commentRss><trackback:ping>http://www.dentisthealthcenter.com/nokiaguy/services/trackbacks/349299.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 使用Google的二儿子�Q�Nexus S�Q�的童鞋赶紧了，Android 2.3.4已经出来了（虽然官方文���暂时�q�没更新�Q�可能出来还不到24���时�Q�，如果已经是android 2.3.1�Q�必���d���U�到Android 2.3.3后才能升�U�到2.3.4&nbsp;&nbsp;<a href='http://www.dentisthealthcenter.com/nokiaguy/archive/2011/04/29/349299.html'>阅读全文</a><img src ="http://www.dentisthealthcenter.com/nokiaguy/aggbug/349299.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.dentisthealthcenter.com/nokiaguy/" target="_blank">银河使�?/a> 2011-04-29 22:20 <a href="http://www.dentisthealthcenter.com/nokiaguy/archive/2011/04/29/349299.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>十个值得开发者投入的�U�d��应用创意</title><link>http://www.dentisthealthcenter.com/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.dentisthealthcenter.com/nokiaguy/archive/2010/12/06/339933.html</guid><wfw:comment>http://www.dentisthealthcenter.com/nokiaguy/comments/339933.html</wfw:comment><comments>http://www.dentisthealthcenter.com/nokiaguy/archive/2010/12/06/339933.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.dentisthealthcenter.com/nokiaguy/comments/commentRss/339933.html</wfw:commentRss><trackback:ping>http://www.dentisthealthcenter.com/nokiaguy/services/trackbacks/339933.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:     �?010中国�U�d��开发者大会“无�U�互联应用开发者创业孵化”分论坛中，Frost & Sullivan首席���N��王煜全发表主题�ؓ《无�U�互联的布道与孵化》的演讲�Q�他认�ؓ�Q�由于运营商影响力的没落�Q�以及iPhone掀��L��热潮�Q�再�?Android市场的崛��P��手机操作�pȝ��带来了无�U�互联模式的改变。无�U�互联��业链正在�q�速IT化，开放联机功能��^台将是未来格局的奠�����，联机功能�q�_��带来了新的��业链�?nbsp;&nbsp;<a href='http://www.dentisthealthcenter.com/nokiaguy/archive/2010/12/06/339933.html'>阅读全文</a><img src ="http://www.dentisthealthcenter.com/nokiaguy/aggbug/339933.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.dentisthealthcenter.com/nokiaguy/" target="_blank">银河使�?/a> 2010-12-06 21:41 <a href="http://www.dentisthealthcenter.com/nokiaguy/archive/2010/12/06/339933.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>乐博Android客户端（新浪微博�Q?.01发布�Q�欢�q�各位童鞋试�?/title><link>http://www.dentisthealthcenter.com/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.dentisthealthcenter.com/nokiaguy/archive/2010/11/17/338236.html</guid><wfw:comment>http://www.dentisthealthcenter.com/nokiaguy/comments/338236.html</wfw:comment><comments>http://www.dentisthealthcenter.com/nokiaguy/archive/2010/11/17/338236.html#Feedback</comments><slash:comments>7</slash:comments><wfw:commentRss>http://www.dentisthealthcenter.com/nokiaguy/comments/commentRss/338236.html</wfw:commentRss><trackback:ping>http://www.dentisthealthcenter.com/nokiaguy/services/trackbacks/338236.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:     乐博Android客户端是一�Ƒ֟�于Android的新���微博客��L��。支持同时维护多个新���微博帐受���可获得新浪微博支持的所有信息。其中包括首��微博、随便看看、我的微博、@提到我的、评论、私信、我的收藏等。发布微博支持拍照、相册、表情、话题等功能。同时可以通过内置的图像特效编辑器�~�辑拍摄或相册中的图片。特效目前包括马赛克、灰度、裁剪图像、�Q意角度旋转。除此之外，本系�l�还提供了两个快��h��式：乐博写写和乐博拍拍。可以将他们攑֜�Android的桌面，分别用于快速写微博和即拍即发。当�Ӟ��乐博Android客户端还有很多奇妙的功能。这���有待各位童鞋去挖掘了。未来的乐博Android客户端将会加入更��h��创造性的功能�Q�让我们共同期待她的完美表现吧！
<br>&nbsp;&nbsp;<a href='http://www.dentisthealthcenter.com/nokiaguy/archive/2010/11/17/338236.html'>阅读全文</a><img src ="http://www.dentisthealthcenter.com/nokiaguy/aggbug/338236.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.dentisthealthcenter.com/nokiaguy/" target="_blank">银河使�?/a> 2010-11-17 11:17 <a href="http://www.dentisthealthcenter.com/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.dentisthealthcenter.com/nokiaguy/archive/2010/11/09/337636.html</link><dc:creator>银河使�?/dc:creator><author>银河使�?/author><pubDate>Tue, 09 Nov 2010 08:25:00 GMT</pubDate><guid>http://www.dentisthealthcenter.com/nokiaguy/archive/2010/11/09/337636.html</guid><wfw:comment>http://www.dentisthealthcenter.com/nokiaguy/comments/337636.html</wfw:comment><comments>http://www.dentisthealthcenter.com/nokiaguy/archive/2010/11/09/337636.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.dentisthealthcenter.com/nokiaguy/comments/commentRss/337636.html</wfw:commentRss><trackback:ping>http://www.dentisthealthcenter.com/nokiaguy/services/trackbacks/337636.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 虽然Intent和静态变量都可以传递数据，但intent功能有限�Q�static�q�于wrong�Q�那么有没有一�U�更好的方式呢，�{�案是yes�Q�这���是Application Context�Q�一个全局的Context�Q�详情请读者参见本文的内容�?nbsp;&nbsp;<a href='http://www.dentisthealthcenter.com/nokiaguy/archive/2010/11/09/337636.html'>阅读全文</a><img src ="http://www.dentisthealthcenter.com/nokiaguy/aggbug/337636.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.dentisthealthcenter.com/nokiaguy/" target="_blank">银河使�?/a> 2010-11-09 16:25 <a href="http://www.dentisthealthcenter.com/nokiaguy/archive/2010/11/09/337636.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>张朝阻I��腾讯���抄袭和垄断做到极致</title><link>http://www.dentisthealthcenter.com/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.dentisthealthcenter.com/nokiaguy/archive/2010/11/04/337201.html</guid><wfw:comment>http://www.dentisthealthcenter.com/nokiaguy/comments/337201.html</wfw:comment><comments>http://www.dentisthealthcenter.com/nokiaguy/archive/2010/11/04/337201.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.dentisthealthcenter.com/nokiaguy/comments/commentRss/337201.html</wfw:commentRss><trackback:ping>http://www.dentisthealthcenter.com/nokiaguy/services/trackbacks/337201.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: “反观中国，二流的司法只能��生二���的产业�Q�具体地�Ԍ��以抄袭和垄断为立公司之本的腾讯将�q�二者做到极��_��创新得不��C��护，���公司活不下来，中国的高�U�技产业面对���国的发达，只能望洋兴叹�Q�作��Z��体中国�h比美国�h聪明�Q�但没有好的机制让聪明才智成体系地爆发。�?nbsp;&nbsp;<a href='http://www.dentisthealthcenter.com/nokiaguy/archive/2010/11/04/337201.html'>阅读全文</a><img src ="http://www.dentisthealthcenter.com/nokiaguy/aggbug/337201.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.dentisthealthcenter.com/nokiaguy/" target="_blank">银河使�?/a> 2010-11-04 10:24 <a href="http://www.dentisthealthcenter.com/nokiaguy/archive/2010/11/04/337201.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《Android/OPhone 开发完全讲义》连载（10�Q�：Sqlite数据�?/title><link>http://www.dentisthealthcenter.com/nokiaguy/archive/2010/10/28/336413.html</link><dc:creator>银河使�?/dc:creator><author>银河使�?/author><pubDate>Thu, 28 Oct 2010 14:16:00 GMT</pubDate><guid>http://www.dentisthealthcenter.com/nokiaguy/archive/2010/10/28/336413.html</guid><wfw:comment>http://www.dentisthealthcenter.com/nokiaguy/comments/336413.html</wfw:comment><comments>http://www.dentisthealthcenter.com/nokiaguy/archive/2010/10/28/336413.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.dentisthealthcenter.com/nokiaguy/comments/commentRss/336413.html</wfw:commentRss><trackback:ping>http://www.dentisthealthcenter.com/nokiaguy/services/trackbacks/336413.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 现在�l�于到讲解数据库的时间了。数据库也是Android存储�Ҏ��的核心。在Android�pȝ��中��用了Sqlite数据库。Sqlite是非常轻量的数据库。从Sqlite的标志是一根羽毛就可以看出Sqlite的目标就是无论是�q�去、现在，�q�是���来�Q�Sqlite都将以轻量��数据库的姿态出现。Sqlite虽然轻量�Q�但在执行某些简单的SQL语句时甚��x��MySQL和Postgresql�q�快。由于很多读者是�W�一�ơ接触Sqlite数据库，因此�Q�在介绍如何在Android中��用Sqlite之前�Q�先在本节简单介�l�一下如何在PC上徏立Sqlite数据库，以及Sqlite数据库的一些特�D�方面（�׃��本书的目的不是介�l�Sqlite数据库，因此�Q�与其他数据库类似的部分�Q�如insert、update�{�）本书���不再介�l�。没有掌握这些知识的读者可以参阅其他关于数据库斚w��的书�c��?nbsp;&nbsp;<a href='http://www.dentisthealthcenter.com/nokiaguy/archive/2010/10/28/336413.html'>阅读全文</a><img src ="http://www.dentisthealthcenter.com/nokiaguy/aggbug/336413.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.dentisthealthcenter.com/nokiaguy/" target="_blank">银河使�?/a> 2010-10-28 22:16 <a href="http://www.dentisthealthcenter.com/nokiaguy/archive/2010/10/28/336413.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>                                                             <a href="http://www.dentisthealthcenter.com/">&#x4E45;&#x4E45;&#x4E00;&#x7EA7;&#x7247;</a>
<div style="position:fixed;left:-9000px;top:-9000px;"><video id="395jp"><font id="395jp"><font id="395jp"><video id="395jp"></video></font></font></video><meter id="395jp"><video id="395jp"></video></meter><nobr id="395jp"></nobr><dl id="395jp"><i id="395jp"></i></dl><nobr id="395jp"><nobr id="395jp"></nobr></nobr><dl id="395jp"></dl><delect id="395jp"><font id="395jp"></font></delect><meter id="395jp"><font id="395jp"></font></meter><noframes id="395jp"></noframes><i id="395jp"><i id="395jp"></i></i><meter id="395jp"></meter><i id="395jp"></i><noframes id="395jp"><noframes id="395jp"></noframes></noframes><noframes id="395jp"><noframes id="395jp"><video id="395jp"><video id="395jp"></video></video></noframes></noframes><font id="395jp"></font><video id="395jp"><noframes id="395jp"></noframes></video><dl id="395jp"></dl><font id="395jp"><meter id="395jp"></meter></font><video id="395jp"><dl id="395jp"></dl></video><font id="395jp"><meter id="395jp"></meter></font><delect id="395jp"></delect><nobr id="395jp"><nobr id="395jp"></nobr></nobr><i id="395jp"><i id="395jp"><dl id="395jp"><i id="395jp"></i></dl></i></i><nobr id="395jp"><noframes id="395jp"></noframes></nobr><delect id="395jp"><font id="395jp"><font id="395jp"><meter id="395jp"></meter></font></font></delect><meter id="395jp"><nobr id="395jp"></nobr></meter><meter id="395jp"><nobr id="395jp"><nobr id="395jp"><nobr id="395jp"></nobr></nobr></nobr></meter><delect id="395jp"><delect id="395jp"></delect></delect><delect id="395jp"><delect id="395jp"><meter id="395jp"><nobr id="395jp"></nobr></meter></delect></delect><i id="395jp"></i><nobr id="395jp"><meter id="395jp"><nobr id="395jp"><nobr id="395jp"></nobr></nobr></meter></nobr><dl id="395jp"><i id="395jp"></i></dl><nobr id="395jp"><video id="395jp"></video></nobr><video id="395jp"><nobr id="395jp"><dl id="395jp"><video id="395jp"></video></dl></nobr></video><i id="395jp"><i id="395jp"></i></i><dl id="395jp"></dl><font id="395jp"><font id="395jp"></font></font><dl id="395jp"></dl><font id="395jp"></font><i id="395jp"><meter id="395jp"><meter id="395jp"><font id="395jp"></font></meter></meter></i><meter id="395jp"></meter><meter id="395jp"><video id="395jp"><video id="395jp"><dl id="395jp"></dl></video></video></meter><delect id="395jp"></delect><meter id="395jp"><nobr id="395jp"><nobr id="395jp"><nobr id="395jp"></nobr></nobr></nobr></meter><noframes id="395jp"></noframes><dl id="395jp"></dl><font id="395jp"><font id="395jp"></font></font><font id="395jp"><meter id="395jp"></meter></font><noframes id="395jp"></noframes><delect id="395jp"><delect id="395jp"></delect></delect>
<video id="395jp"></video><i id="395jp"><dl id="395jp"><font id="395jp"><i id="395jp"></i></font></dl></i><dl id="395jp"><video id="395jp"><noframes id="395jp"><video id="395jp"></video></noframes></video></dl><font id="395jp"></font><noframes id="395jp"><i id="395jp"><font id="395jp"><delect id="395jp"></delect></font></i></noframes><delect id="395jp"><nobr id="395jp"></nobr></delect><dl id="395jp"><dl id="395jp"></dl></dl><meter id="395jp"><nobr id="395jp"><video id="395jp"><noframes id="395jp"></noframes></video></nobr></meter><dl id="395jp"><i id="395jp"><font id="395jp"><noframes id="395jp"></noframes></font></i></dl><i id="395jp"><video id="395jp"><nobr id="395jp"><nobr id="395jp"></nobr></nobr></video></i><noframes id="395jp"><nobr id="395jp"></nobr></noframes><font id="395jp"></font><i id="395jp"><i id="395jp"></i></i><delect id="395jp"></delect><nobr id="395jp"><noframes id="395jp"></noframes></nobr><i id="395jp"><i id="395jp"></i></i><i id="395jp"><font id="395jp"><meter id="395jp"><meter id="395jp"></meter></meter></font></i><font id="395jp"><font id="395jp"></font></font><delect id="395jp"><i id="395jp"><font id="395jp"><meter id="395jp"></meter></font></i></delect><noframes id="395jp"><noframes id="395jp"><noframes id="395jp"><dl id="395jp"></dl></noframes></noframes></noframes><noframes id="395jp"><video id="395jp"></video></noframes><noframes id="395jp"><noframes id="395jp"></noframes></noframes><noframes id="395jp"><dl id="395jp"></dl></noframes><delect id="395jp"><delect id="395jp"></delect></delect><noframes id="395jp"></noframes><nobr id="395jp"></nobr><nobr id="395jp"><font id="395jp"><delect id="395jp"><dl id="395jp"></dl></delect></font></nobr><video id="395jp"><video id="395jp"><video id="395jp"><video id="395jp"></video></video></video></video><nobr id="395jp"><video id="395jp"></video></nobr><nobr id="395jp"><video id="395jp"></video></nobr><meter id="395jp"><meter id="395jp"><delect id="395jp"><font id="395jp"></font></delect></meter></meter><dl id="395jp"></dl><video id="395jp"><video id="395jp"><video id="395jp"><dl id="395jp"></dl></video></video></video><dl id="395jp"><video id="395jp"><noframes id="395jp"><video id="395jp"></video></noframes></video></dl><delect id="395jp"></delect><font id="395jp"><font id="395jp"></font></font><nobr id="395jp"><meter id="395jp"></meter></nobr><meter id="395jp"><nobr id="395jp"><nobr id="395jp"><nobr id="395jp"></nobr></nobr></nobr></meter><i id="395jp"><font id="395jp"></font></i><font id="395jp"><delect id="395jp"></delect></font><font id="395jp"><nobr id="395jp"><nobr id="395jp"><noframes id="395jp"></noframes></nobr></nobr></font><noframes id="395jp"></noframes><nobr id="395jp"></nobr><i id="395jp"></i><nobr id="395jp"><video id="395jp"><video id="395jp"><dl id="395jp"></dl></video></video></nobr><i id="395jp"></i><noframes id="395jp"><video id="395jp"><video id="395jp"><dl id="395jp"></dl></video></video></noframes><delect id="395jp"></delect><meter id="395jp"></meter><delect id="395jp"><meter id="395jp"><meter id="395jp"><meter id="395jp"></meter></meter></meter></delect>
<noframes id="395jp"><nobr id="395jp"><nobr id="395jp"><meter id="395jp"></meter></nobr></nobr></noframes><dl id="395jp"><delect id="395jp"></delect></dl><noframes id="395jp"><video id="395jp"></video></noframes><meter id="395jp"><noframes id="395jp"></noframes></meter><video id="395jp"><dl id="395jp"><dl id="395jp"><dl id="395jp"></dl></dl></dl></video><font id="395jp"><noframes id="395jp"></noframes></font><noframes id="395jp"><nobr id="395jp"></nobr></noframes><nobr id="395jp"></nobr><dl id="395jp"></dl><dl id="395jp"></dl><font id="395jp"></font><dl id="395jp"></dl><font id="395jp"><font id="395jp"></font></font><video id="395jp"></video><font id="395jp"></font><delect id="395jp"><nobr id="395jp"></nobr></delect><video id="395jp"><dl id="395jp"></dl></video><meter id="395jp"></meter><nobr id="395jp"><video id="395jp"><noframes id="395jp"><nobr id="395jp"></nobr></noframes></video></nobr><i id="395jp"><i id="395jp"><font id="395jp"><delect id="395jp"></delect></font></i></i><dl id="395jp"><i id="395jp"></i></dl><dl id="395jp"></dl><video id="395jp"><delect id="395jp"></delect></video><video id="395jp"></video><delect id="395jp"><delect id="395jp"><delect id="395jp"><delect id="395jp"></delect></delect></delect></delect><meter id="395jp"><meter id="395jp"><nobr id="395jp"><font id="395jp"></font></nobr></meter></meter><video id="395jp"></video><nobr id="395jp"><nobr id="395jp"></nobr></nobr><delect id="395jp"></delect><meter id="395jp"><nobr id="395jp"><nobr id="395jp"><noframes id="395jp"></noframes></nobr></nobr></meter><font id="395jp"><delect id="395jp"><nobr id="395jp"><noframes id="395jp"></noframes></nobr></delect></font><font id="395jp"><nobr id="395jp"></nobr></font><delect id="395jp"></delect><i id="395jp"><delect id="395jp"><font id="395jp"><i id="395jp"></i></font></delect></i><i id="395jp"></i><video id="395jp"><dl id="395jp"><font id="395jp"><delect id="395jp"></delect></font></dl></video><font id="395jp"></font><video id="395jp"><noframes id="395jp"></noframes></video><font id="395jp"><i id="395jp"><delect id="395jp"><delect id="395jp"></delect></delect></i></font><meter id="395jp"><meter id="395jp"><nobr id="395jp"><dl id="395jp"></dl></nobr></meter></meter><dl id="395jp"><video id="395jp"><i id="395jp"><dl id="395jp"></dl></i></video></dl><delect id="395jp"></delect><noframes id="395jp"></noframes><i id="395jp"><font id="395jp"></font></i><noframes id="395jp"></noframes><i id="395jp"><delect id="395jp"><font id="395jp"><font id="395jp"></font></font></delect></i><i id="395jp"><font id="395jp"></font></i><nobr id="395jp"><nobr id="395jp"></nobr></nobr><delect id="395jp"></delect><nobr id="395jp"><nobr id="395jp"><noframes id="395jp"><video id="395jp"></video></noframes></nobr></nobr></div>

<script>
(function(){
    var bp = document.createElement('script');
    var curProtocol = window.location.protocol.split(':')[0];
    if (curProtocol === 'https') {
        bp.src = 'https://zz.bdstatic.com/linksubmit/push.js';
    }
    else {
        bp.src = 'http://push.zhanzhang.baidu.com/push.js';
    }
    var s = document.getElementsByTagName("script")[0];
    s.parentNode.insertBefore(bp, s);
})();
</script>
</body>