﻿<?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/39413.html</link><description /><language>zh-cn</language><lastBuildDate>Sat, 02 Feb 2013 23:52:44 GMT</lastBuildDate><pubDate>Sat, 02 Feb 2013 23:52:44 GMT</pubDate><ttl>60</ttl><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>4</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/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开发完全讲义》连载（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>《人人都玩开心网：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>《人人都玩开心网：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>新书内容连载（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/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>《Java Web开发速学宝典》样章（共3章）</title><link>http://www.blogjava.net/nokiaguy/archive/2009/12/14/305890.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Mon, 14 Dec 2009 06:33:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2009/12/14/305890.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/305890.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2009/12/14/305890.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/305890.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/305890.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 第4章 Servlet开发基础、第8章 Java Web国际化、第10章 简单标签&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2009/12/14/305890.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/305890.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2009-12-14 14:33 <a href="http://www.blogjava.net/nokiaguy/archive/2009/12/14/305890.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Java Web开发速学宝典（JSP+Servlet+Struts 2 + Hibernate + Spring）源代码下载</title><link>http://www.blogjava.net/nokiaguy/archive/2009/11/16/302547.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Mon, 16 Nov 2009 05:14:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2009/11/16/302547.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/302547.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2009/11/16/302547.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/302547.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/302547.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 由于有些读者因随书光盘遗失，应广大读者的要求，特提供《Java Web开发速学宝典》一书的源代码下载，由于源代码所使用的jar包过大（随书光盘中包含了完整的源代码和jar包），在这里只提供了jar文件的列表，读者可以自行获得这些jar包。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2009/11/16/302547.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/302547.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2009-11-16 13:14 <a href="http://www.blogjava.net/nokiaguy/archive/2009/11/16/302547.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>新书出版：Java Web开发速学宝典，欢迎试读</title><link>http://www.blogjava.net/nokiaguy/archive/2009/09/21/295835.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Mon, 21 Sep 2009 04:11:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2009/09/21/295835.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/295835.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2009/09/21/295835.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/295835.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/295835.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 本书主要对Java Web的核心技术——JSP和Servlet进行讲解，此外，本书还对目前流行的MVC框架Struts 2（版本为Struts 2.1.6）的核心功能以及如何整合Spring与Hibernate进行了由浅入深的介绍。.本书分为4篇，第1篇对开发Java Web程序所必须掌握的技术进行讲解，并用一个实例带领读者进入Java Web世界；第2篇主要讲解JSP技术，使读者可以掌握JSP的核心技术；第3篇讲解Struts 2的核心内容，以及如何将Struts 2、Spring和Hibernate进行整合；第4篇是综合实例，通过对3个完整项目的学习，读者可以更好地对本书前3篇所讲的内容进行理解和消化。本书的读者对象包括：已经掌握Java基础知识，想学习Java Web技术的读者；已经掌握Java Web的基础知识，想进一步了解和掌握Java Web核心技术的读者；对JSP和Servlet技术比较熟悉，想进一步学习和掌握Struts 2，并想将Struts 2技术引入Java Web应用的读者。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2009/09/21/295835.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/295835.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2009-09-21 12:11 <a href="http://www.blogjava.net/nokiaguy/archive/2009/09/21/295835.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>新书出版：Java Web开发技术大全——JSP+Servlet+Struts 2+Hibernate+Spring+Ajax （附源代码）</title><link>http://www.blogjava.net/nokiaguy/archive/2009/05/06/269145.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Wed, 06 May 2009 00:52:00 GMT</pubDate><guid>http://www.blogjava.net/nokiaguy/archive/2009/05/06/269145.html</guid><wfw:comment>http://www.blogjava.net/nokiaguy/comments/269145.html</wfw:comment><comments>http://www.blogjava.net/nokiaguy/archive/2009/05/06/269145.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.blogjava.net/nokiaguy/comments/commentRss/269145.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/nokiaguy/services/trackbacks/269145.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: SSH是目前最流行的Java Web开发技术。本书通过对SSH中的各种技术循序渐进地讲解，使读者尽快掌握开发基于SSH的Web程序的方法。本书内容包括Web客户端技术、JSP/Servlet技术、Struts 2（拦截器、类型转换、输入校验、上传和下载文件、Struts 2的各种标签、对 AJAX的支持等）、Spring（Ioc容器、装配Java Bean、Jdbc和Hibernate模板、事务管理、Spring AOP等）以及 Hibernate（会话、映射、标准查询API、HQL、事务管理、锁等）。除此之外，本书还提供了两个完整的实例来讲解开发SSH的详细步骤和方法。通过对这两个实例的学习，读者可以对SSH开发模式有更透彻地理解和认识。&nbsp;&nbsp;<a href='http://www.blogjava.net/nokiaguy/archive/2009/05/06/269145.html'>阅读全文</a><img src ="http://www.blogjava.net/nokiaguy/aggbug/269145.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/nokiaguy/" target="_blank">银河使者</a> 2009-05-06 08:52 <a href="http://www.blogjava.net/nokiaguy/archive/2009/05/06/269145.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>