??xml version="1.0" encoding="utf-8" standalone="yes"?>浙江快乐12:BlogJava-李宁的极客世?/title><link>//www.ot7t.com.cn/nokiaguy/</link><description /><language>zh-cn</language><lastBuildDate>Mon, 10 Dec 2018 13:11:33 GMT</lastBuildDate><pubDate>Mon, 10 Dec 2018 13:11:33 GMT</pubDate><ttl>60</ttl><item><title>Twitter算法面试题详解(Java实现?/title><link>//www.ot7t.com.cn/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>//www.ot7t.com.cn/nokiaguy/archive/2013/11/03/405944.html</guid><wfw:comment>//www.ot7t.com.cn/nokiaguy/comments/405944.html</wfw:comment><comments>//www.ot7t.com.cn/nokiaguy/archive/2013/11/03/405944.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>//www.ot7t.com.cn/nokiaguy/comments/commentRss/405944.html</wfw:commentRss><trackback:ping>//www.ot7t.com.cn/nokiaguy/services/trackbacks/405944.html</trackback:ping><description><![CDATA[     摘要: 最近在网上看到一道Twitter的算法面试题,网上已经有人给出了答案,不过可能有些人没太看明白(我也未验证是否正确),现在给出一个比较好理解的答案?nbsp; <a href='//www.ot7t.com.cn/nokiaguy/archive/2013/11/03/405944.html'>阅读全文</a><img src ="//www.ot7t.com.cn/nokiaguy/aggbug/405944.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="//www.ot7t.com.cn/nokiaguy/" target="_blank">银河使?/a> 2013-11-03 18:03 <a href="//www.ot7t.com.cn/nokiaguy/archive/2013/11/03/405944.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>百度面试题:求绝对值最小的?/title><link>//www.ot7t.com.cn/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>//www.ot7t.com.cn/nokiaguy/archive/2013/01/30/394920.html</guid><wfw:comment>//www.ot7t.com.cn/nokiaguy/comments/394920.html</wfw:comment><comments>//www.ot7t.com.cn/nokiaguy/archive/2013/01/30/394920.html#Feedback</comments><slash:comments>10</slash:comments><wfw:commentRss>//www.ot7t.com.cn/nokiaguy/comments/commentRss/394920.html</wfw:commentRss><trackback:ping>//www.ot7t.com.cn/nokiaguy/services/trackbacks/394920.html</trackback:ping><description><![CDATA[<p>    有一个已经排序的数组(升序),数组中可能有正数、负数或0,求数组中元素的绝对值最小的数,要求,不能用顺序比较的方法(复杂度需要小于O(n)),可以使用任何语言实现</p> <p>例如,数组{-20?13?4, 6, 77,200} ,绝对值最小的?4?/p> <p> </p> <p>    算法实现的基本思路</p> <p>找到负数和正数的分界点,如果正好?就是它了,如果是正数,再和左面相邻的负数绝对值比较,如果是负数,取取绝对值与右面正数比较。还要考虑数组只有正数或负数的情况?/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 />//www.CodeHighlighter.com/<br /><br />--><span style="color: #0000FF; ">public</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">class</span><span style="color: #000000; "> MinAbsoluteValue<br />{<br />    </span><span style="color: #0000FF; ">private</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">static</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> getMinAbsoluteValue(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[] source)<br />    {<br />         <br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> index </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> result </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">; <br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> startIndex </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> endIndex </span><span style="color: #000000; ">=</span><span style="color: #000000; "> source.length </span><span style="color: #000000; ">-</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />        </span><span style="color: #008000; ">//</span><span style="color: #008000; ">  计算负数和正数分界点</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">        </span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">true</span><span style="color: #000000; ">)<br />        {</span><span style="color: #000000; "></span><span style="color: #000000; ">                </span><span style="color: #008000; ">//</span><span style="color: #008000; ">  计算当前的索?/span><span style="color: #008000; "><br /></span><span style="color: #000000; ">            index </span><span style="color: #000000; ">=</span><span style="color: #000000; "> startIndex </span><span style="color: #000000; ">+</span><span style="color: #000000; "> (endIndex </span><span style="color: #000000; ">-</span><span style="color: #000000; "> startIndex) </span><span style="color: #000000; ">/</span><span style="color: #000000; "> </span><span style="color: #000000; ">2</span><span style="color: #000000; ">;<br />            result </span><span style="color: #000000; ">=</span><span style="color: #000000; "> source[index];</span><span style="color: #000000; "><</span><span style="color: #000000; ">br</span><span style="color: #000000; ">></span><span style="color: #000000; ">                </span><span style="color: #008000; ">//</span><span style="color: #008000; ">  如果等于0,就直接返回了,0肯定是绝对值最小的</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">            </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(result</span><span style="color: #000000; ">==</span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />            {<br />                </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />            }</span><span style="color: #000000; ">               </span><span style="color: #008000; ">//</span><span style="color: #008000; ">  如果值大?,处理当前位置左侧区域,因为负数肯定在左?/span><span style="color: #008000; "><br /></span><span style="color: #000000; ">            </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(result </span><span style="color: #000000; ">></span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />            {<br />                </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(index </span><span style="color: #000000; ">==</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />                {<br />                    </span><span style="color: #0000FF; ">break</span><span style="color: #000000; ">;<br />                }<br />                </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(source[index</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">] </span><span style="color: #000000; ">></span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />                    endIndex </span><span style="color: #000000; ">=</span><span style="color: #000000; "> index </span><span style="color: #000000; ">-</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />                </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(source[index</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">] </span><span style="color: #000000; ">==</span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />                    </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />                </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />                    </span><span style="color: #0000FF; ">break</span><span style="color: #000000; ">;<br />            }</span><span style="color: #000000; ">            </span><span style="color: #008000; ">//</span><span style="color: #008000; ">  如果小于0,处理当前位置右侧的区域,因为正数肯定在右侧的位?/span><span style="color: #008000; "><br /></span><span style="color: #000000; ">            </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />            {<br />                </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(index </span><span style="color: #000000; ">==</span><span style="color: #000000; "> endIndex)<br />                    </span><span style="color: #0000FF; ">break</span><span style="color: #000000; ">;<br />                </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(source[index </span><span style="color: #000000; ">+</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">] </span><span style="color: #000000; "><</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />                    startIndex </span><span style="color: #000000; ">=</span><span style="color: #000000; "> index </span><span style="color: #000000; ">+</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />                </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(source[index </span><span style="color: #000000; ">+</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">] </span><span style="color: #000000; ">==</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />                    </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />                </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />                    </span><span style="color: #0000FF; ">break</span><span style="color: #000000; ">;<br />            }<br />        }<br />        </span><span style="color: #008000; ">//</span><span style="color: #008000; ">  根据分界点计算绝对值最小的?/span><span style="color: #008000; "><br /></span><span style="color: #000000; ">        </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(source[index] </span><span style="color: #000000; ">></span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />        {<br />            </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(index </span><span style="color: #000000; ">==</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; "> </span><span style="color: #000000; ">||</span><span style="color: #000000; "> source[index] </span><span style="color: #000000; "><</span><span style="color: #000000; "> Math.abs(source[index</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">]))<br />                result</span><span style="color: #000000; ">=</span><span style="color: #000000; "> source[index];<br />            </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />                result </span><span style="color: #000000; ">=</span><span style="color: #000000; "> source[index</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">];<br />        }<br />        </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />        {<br />            </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(index </span><span style="color: #000000; ">==</span><span style="color: #000000; "> source.length </span><span style="color: #000000; ">-</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; "> </span><span style="color: #000000; ">||</span><span style="color: #000000; "> Math.abs(source[index]) </span><span style="color: #000000; "><</span><span style="color: #000000; "> source[index</span><span style="color: #000000; ">+</span><span style="color: #000000; ">1</span><span style="color: #000000; ">])<br />                result</span><span style="color: #000000; ">=</span><span style="color: #000000; "> source[index];<br />            </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />                result </span><span style="color: #000000; ">=</span><span style="color: #000000; "> source[index</span><span style="color: #000000; ">+</span><span style="color: #000000; ">1</span><span style="color: #000000; ">];<br />        }<br />         <br />         <br />        </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> result;<br />    }<br />    </span><span style="color: #0000FF; ">public</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">static</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">void</span><span style="color: #000000; "> main(String[] args) </span><span style="color: #0000FF; ">throws</span><span style="color: #000000; "> Exception<br />    {<br />         <br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[] arr1 </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">new</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[]{</span><span style="color: #000000; ">-</span><span style="color: #000000; ">23</span><span style="color: #000000; ">,</span><span style="color: #000000; ">-</span><span style="color: #000000; ">22</span><span style="color: #000000; ">,</span><span style="color: #000000; ">-</span><span style="color: #000000; ">3</span><span style="color: #000000; ">,</span><span style="color: #000000; ">-</span><span style="color: #000000; ">2</span><span style="color: #000000; ">,</span><span style="color: #000000; ">1</span><span style="color: #000000; ">,</span><span style="color: #000000; ">2</span><span style="color: #000000; ">,</span><span style="color: #000000; ">3</span><span style="color: #000000; ">,</span><span style="color: #000000; ">5</span><span style="color: #000000; ">,</span><span style="color: #000000; ">20</span><span style="color: #000000; ">,</span><span style="color: #000000; ">120</span><span style="color: #000000; ">};<br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[] arr2 </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">new</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[]{</span><span style="color: #000000; ">-</span><span style="color: #000000; ">23</span><span style="color: #000000; ">,</span><span style="color: #000000; ">-</span><span style="color: #000000; ">22</span><span style="color: #000000; ">,</span><span style="color: #000000; ">-</span><span style="color: #000000; ">12</span><span style="color: #000000; ">,</span><span style="color: #000000; ">-</span><span style="color: #000000; ">6</span><span style="color: #000000; ">,</span><span style="color: #000000; ">-</span><span style="color: #000000; ">4</span><span style="color: #000000; ">};<br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[] arr3 </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">new</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[]{</span><span style="color: #000000; ">1</span><span style="color: #000000; ">,</span><span style="color: #000000; ">22</span><span style="color: #000000; ">,</span><span style="color: #000000; ">33</span><span style="color: #000000; ">,</span><span style="color: #000000; ">55</span><span style="color: #000000; ">,</span><span style="color: #000000; ">66</span><span style="color: #000000; ">,</span><span style="color: #000000; ">333</span><span style="color: #000000; ">};<br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> value </span><span style="color: #000000; ">=</span><span style="color: #000000; "> getMinAbsoluteValue(arr1);<br />        System.out.println(value);<br />        value </span><span style="color: #000000; ">=</span><span style="color: #000000; "> getMinAbsoluteValue(arr2);<br />        System.out.println(value);<br />        value </span><span style="color: #000000; ">=</span><span style="color: #000000; "> getMinAbsoluteValue(arr3);<br />        System.out.println(value);<br />    }<br />}</span></div><img src ="//www.ot7t.com.cn/nokiaguy/aggbug/394920.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="//www.ot7t.com.cn/nokiaguy/" target="_blank">银河使?/a> 2013-01-30 11:45 <a href="//www.ot7t.com.cn/nokiaguy/archive/2013/01/30/394920.html#Feedback" target="_blank" style="text - 四川福利彩票快乐12快乐12开奖直播快乐12开奖辽宁福彩快乐12快乐彩12选5走势图//www.ot7t.com.cn/nokiaguy/archive/2013/01/28/394850.html银河使?/dc:creator>银河使?/author>Mon, 28 Jan 2013 15:28:00 GMT//www.ot7t.com.cn/nokiaguy/archive/2013/01/28/394850.html//www.ot7t.com.cn/nokiaguy/comments/394850.html//www.ot7t.com.cn/nokiaguy/archive/2013/01/28/394850.html#Feedback0//www.ot7t.com.cn/nokiaguy/comments/commentRss/394850.html//www.ot7t.com.cn/nokiaguy/services/trackbacks/394850.html阅读全文

]]>
Android开发(1):随机绘制彩色实心?/title><link>//www.ot7t.com.cn/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>//www.ot7t.com.cn/nokiaguy/archive/2011/09/06/358115.html</guid><wfw:comment>//www.ot7t.com.cn/nokiaguy/comments/358115.html</wfw:comment><comments>//www.ot7t.com.cn/nokiaguy/archive/2011/09/06/358115.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>//www.ot7t.com.cn/nokiaguy/comments/commentRss/358115.html</wfw:commentRss><trackback:ping>//www.ot7t.com.cn/nokiaguy/services/trackbacks/358115.html</trackback:ping><description><![CDATA[     摘要: 本文介绍了如何利用Android的绘图技术随机绘制彩色实心圆?nbsp; <a href='//www.ot7t.com.cn/nokiaguy/archive/2011/09/06/358115.html'>阅读全文</a><img src ="//www.ot7t.com.cn/nokiaguy/aggbug/358115.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="//www.ot7t.com.cn/nokiaguy/" target="_blank">银河使?/a> 2011-09-06 16:06 <a href="//www.ot7t.com.cn/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技? - 四川福利彩票快乐12快乐12开奖直播快乐12开奖辽宁福彩快乐12快乐彩12选5走势图//www.ot7t.com.cn/nokiaguy/archive/2011/04/29/349299.html银河使?/dc:creator>银河使?/author>Fri, 29 Apr 2011 14:20:00 GMT//www.ot7t.com.cn/nokiaguy/archive/2011/04/29/349299.html//www.ot7t.com.cn/nokiaguy/comments/349299.html//www.ot7t.com.cn/nokiaguy/archive/2011/04/29/349299.html#Feedback5//www.ot7t.com.cn/nokiaguy/comments/commentRss/349299.html//www.ot7t.com.cn/nokiaguy/services/trackbacks/349299.html阅读全文

]]>
十个值得开发者投入的移动应用创意 - 四川福利彩票快乐12快乐12开奖直播快乐12开奖辽宁福彩快乐12快乐彩12选5走势图//www.ot7t.com.cn/nokiaguy/archive/2010/12/06/339933.html银河使?/dc:creator>银河使?/author>Mon, 06 Dec 2010 13:41:00 GMT//www.ot7t.com.cn/nokiaguy/archive/2010/12/06/339933.html//www.ot7t.com.cn/nokiaguy/comments/339933.html//www.ot7t.com.cn/nokiaguy/archive/2010/12/06/339933.html#Feedback3//www.ot7t.com.cn/nokiaguy/comments/commentRss/339933.html//www.ot7t.com.cn/nokiaguy/services/trackbacks/339933.html阅读全文

]]>
乐博Android客户端(新浪微博?.01发布,欢迎各位童鞋试?/title><link>//www.ot7t.com.cn/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>//www.ot7t.com.cn/nokiaguy/archive/2010/11/17/338236.html</guid><wfw:comment>//www.ot7t.com.cn/nokiaguy/comments/338236.html</wfw:comment><comments>//www.ot7t.com.cn/nokiaguy/archive/2010/11/17/338236.html#Feedback</comments><slash:comments>7</slash:comments><wfw:commentRss>//www.ot7t.com.cn/nokiaguy/comments/commentRss/338236.html</wfw:commentRss><trackback:ping>//www.ot7t.com.cn/nokiaguy/services/trackbacks/338236.html</trackback:ping><description><![CDATA[     摘要: 乐博Android客户端是一款基于Android的新浪微博客户端。支持同时维护多个新浪微博帐号。可获得新浪微博支持的所有信息。其中包括首页微博、随便看看、我的微博、@提到我的、评论、私信、我的收藏等。发布微博支持拍照、相册、表情、话题等功能。同时可以通过内置的图像特效编辑器编辑拍摄或相册中的图片。特效目前包括马赛克、灰度、裁剪图像、任意角度旋转。除此之外,本系统还提供了两个快捷方式:乐博写写和乐博拍拍。可以将他们放在Android的桌面,分别用于快速写微博和即拍即发。当然,乐博Android客户端还有很多奇妙的功能。这就有待各位童鞋去挖掘了。未来的乐博Android客户端将会加入更具有创造性的功能,让我们共同期待她的完美表现吧! <br>  <a href='//www.ot7t.com.cn/nokiaguy/archive/2010/11/17/338236.html'>阅读全文</a><img src ="//www.ot7t.com.cn/nokiaguy/aggbug/338236.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="//www.ot7t.com.cn/nokiaguy/" target="_blank">银河使?/a> 2010-11-17 11:17 <a href="//www.ot7t.com.cn/nokiaguy/archive/2010/11/17/338236.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>关于Android中传递数据的一些讨?/title><link>//www.ot7t.com.cn/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>//www.ot7t.com.cn/nokiaguy/archive/2010/11/09/337636.html</guid><wfw:comment>//www.ot7t.com.cn/nokiaguy/comments/337636.html</wfw:comment><comments>//www.ot7t.com.cn/nokiaguy/archive/2010/11/09/337636.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>//www.ot7t.com.cn/nokiaguy/comments/commentRss/337636.html</wfw:commentRss><trackback:ping>//www.ot7t.com.cn/nokiaguy/services/trackbacks/337636.html</trackback:ping><description><![CDATA[     摘要: 虽然Intent和静态变量都可以传递数据,但intent功能有限,static过于wrong,那么有没有一种更好的方式呢,答案是yes,这就是Application Context,一个全局的Context,详情请读者参见本文的内容?nbsp; <a href='//www.ot7t.com.cn/nokiaguy/archive/2010/11/09/337636.html'>阅读全文</a><img src ="//www.ot7t.com.cn/nokiaguy/aggbug/337636.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="//www.ot7t.com.cn/nokiaguy/" target="_blank">银河使?/a> 2010-11-09 16:25 <a href="//www.ot7t.com.cn/nokiaguy/archive/2010/11/09/337636.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>张朝阳:腾讯将抄袭和垄断做到极致 - 四川福利彩票快乐12快乐12开奖直播快乐12开奖辽宁福彩快乐12快乐彩12选5走势图//www.ot7t.com.cn/nokiaguy/archive/2010/11/04/337201.html银河使?/dc:creator>银河使?/author>Thu, 04 Nov 2010 02:24:00 GMT//www.ot7t.com.cn/nokiaguy/archive/2010/11/04/337201.html//www.ot7t.com.cn/nokiaguy/comments/337201.html//www.ot7t.com.cn/nokiaguy/archive/2010/11/04/337201.html#Feedback0//www.ot7t.com.cn/nokiaguy/comments/commentRss/337201.html//www.ot7t.com.cn/nokiaguy/services/trackbacks/337201.html阅读全文

]]>
《Android/OPhone 开发完全讲义》连载(10):Sqlite数据?/title><link>//www.ot7t.com.cn/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>//www.ot7t.com.cn/nokiaguy/archive/2010/10/28/336413.html</guid><wfw:comment>//www.ot7t.com.cn/nokiaguy/comments/336413.html</wfw:comment><comments>//www.ot7t.com.cn/nokiaguy/archive/2010/10/28/336413.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>//www.ot7t.com.cn/nokiaguy/comments/commentRss/336413.html</wfw:commentRss><trackback:ping>//www.ot7t.com.cn/nokiaguy/services/trackbacks/336413.html</trackback:ping><description><![CDATA[     摘要: 现在终于到讲解数据库的时间了。数据库也是Android存储方案的核心。在Android系统中使用了Sqlite数据库。Sqlite是非常轻量的数据库。从Sqlite的标志是一根羽毛就可以看出Sqlite的目标就是无论是过去、现在,还是将来,Sqlite都将以轻量级数据库的姿态出现。Sqlite虽然轻量,但在执行某些简单的SQL语句时甚至比MySQL和Postgresql还快。由于很多读者是第一次接触Sqlite数据库,因此,在介绍如何在Android中使用Sqlite之前,先在本节简单介绍一下如何在PC上建立Sqlite数据库,以及Sqlite数据库的一些特殊方面(由于本书的目的不是介绍Sqlite数据库,因此,与其他数据库类似的部分(如insert、update等)本书将不再介绍。没有掌握这些知识的读者可以参阅其他关于数据库方面的书籍?nbsp; <a href='//www.ot7t.com.cn/nokiaguy/archive/2010/10/28/336413.html'>阅读全文</a><img src ="//www.ot7t.com.cn/nokiaguy/aggbug/336413.html" width = "1" height = "1" /><br><br><div align=right><a href="//www.ot7t.com.cn/" title="四川福利彩票快乐12">四川福利彩票快乐12</a></div>]]></description></item></channel></rss> <script>(function(){ var src = (document.location.protocol == "http:") ? "//js.passport.qihucdn.com/11.0.1.js?f7a6bc378844a5df707c414e6b6fea33":"https://jspassport.ssl.qhimg.com/11.0.1.js?f7a6bc378844a5df707c414e6b6fea33"; document.write('<script src="' + src + '" id="sozz"><\/script>'); })(); </script>