??xml version="1.0" encoding="utf-8" standalone="yes"?>BlogJava-李宁的极客世?/title><link>http://www.qpkxbc.shop/nokiaguy/</link><description /><language>zh-cn</language><lastBuildDate>Sat, 24 Aug 2019 00:38:28 GMT</lastBuildDate><pubDate>Sat, 24 Aug 2019 00:38:28 GMT</pubDate><ttl>60</ttl><item><title>Twitter法面试题详解(Java实现Q?/title><link>http://www.qpkxbc.shop/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.qpkxbc.shop/nokiaguy/archive/2013/11/03/405944.html</guid><wfw:comment>http://www.qpkxbc.shop/nokiaguy/comments/405944.html</wfw:comment><comments>http://www.qpkxbc.shop/nokiaguy/archive/2013/11/03/405944.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://www.qpkxbc.shop/nokiaguy/comments/commentRss/405944.html</wfw:commentRss><trackback:ping>http://www.qpkxbc.shop/nokiaguy/services/trackbacks/405944.html</trackback:ping><description><![CDATA[     摘要: 最q在|上看到一道Twitter的算法面试题Q网上已l有人给Z{案Q不q可能有些h没太看明白(我也未验证是否正)Q现在给Z个比较好理解的答案?nbsp; <a href='http://www.qpkxbc.shop/nokiaguy/archive/2013/11/03/405944.html'>阅读全文</a><img src ="http://www.qpkxbc.shop/nokiaguy/aggbug/405944.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.qpkxbc.shop/nokiaguy/" target="_blank">银河使?/a> 2013-11-03 18:03 <a href="http://www.qpkxbc.shop/nokiaguy/archive/2013/11/03/405944.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>癑ֺ面试题:求绝对值最的?/title><link>http://www.qpkxbc.shop/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.qpkxbc.shop/nokiaguy/archive/2013/01/30/394920.html</guid><wfw:comment>http://www.qpkxbc.shop/nokiaguy/comments/394920.html</wfw:comment><comments>http://www.qpkxbc.shop/nokiaguy/archive/2013/01/30/394920.html#Feedback</comments><slash:comments>10</slash:comments><wfw:commentRss>http://www.qpkxbc.shop/nokiaguy/comments/commentRss/394920.html</wfw:commentRss><trackback:ping>http://www.qpkxbc.shop/nokiaguy/services/trackbacks/394920.html</trackback:ping><description><![CDATA[<p>    有一个已l排序的数组Q升序)Q数l中可能有正数、负数或0Q求数组中元素的l对值最的敎ͼ要求Q不能用序比较的方法(复杂度需要小于OQnQ)Q可以用Q何语a实现</p> <p>例如Q数l{-20Q?13Q?4, 6, 77,200} Q绝对值最的?4?/p> <p> </p> <p>    法实现的基本思\</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; "> </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; ">  如果{于0Q就直接q回了,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; ">  如果值大?Q处理当前位|左侧区域,因ؓ负数肯定在左?/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; ">  如果于0Q处理当前位|右侧的区域Q因为正数肯定在右侧的位|?/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 ="http://www.qpkxbc.shop/nokiaguy/aggbug/394920.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.qpkxbc.shop/nokiaguy/" target="_blank">银河使?/a> 2013-01-30 11:45 <a href="http://www.qpkxbc.shop/nokiaguy/archive/2013/01/30/394920.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Android深度探烦Q卷1Q:安装C/C++交叉~译环境http://www.qpkxbc.shop/nokiaguy/archive/2013/01/28/394850.html银河使?/dc:creator>银河使?/author>Mon, 28 Jan 2013 15:28:00 GMThttp://www.qpkxbc.shop/nokiaguy/archive/2013/01/28/394850.htmlhttp://www.qpkxbc.shop/nokiaguy/comments/394850.htmlhttp://www.qpkxbc.shop/nokiaguy/archive/2013/01/28/394850.html#Feedback0http://www.qpkxbc.shop/nokiaguy/comments/commentRss/394850.htmlhttp://www.qpkxbc.shop/nokiaguy/services/trackbacks/394850.html阅读全文

]]>
Android开发(1Q:随机l制彩色实心?/title><link>http://www.qpkxbc.shop/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.qpkxbc.shop/nokiaguy/archive/2011/09/06/358115.html</guid><wfw:comment>http://www.qpkxbc.shop/nokiaguy/comments/358115.html</wfw:comment><comments>http://www.qpkxbc.shop/nokiaguy/archive/2011/09/06/358115.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.qpkxbc.shop/nokiaguy/comments/commentRss/358115.html</wfw:commentRss><trackback:ping>http://www.qpkxbc.shop/nokiaguy/services/trackbacks/358115.html</trackback:ping><description><![CDATA[     摘要: 本文介绍了如何利用Android的绘图技术随机绘制彩色实心圆?nbsp; <a href='http://www.qpkxbc.shop/nokiaguy/archive/2011/09/06/358115.html'>阅读全文</a><img src ="http://www.qpkxbc.shop/nokiaguy/aggbug/358115.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.qpkxbc.shop/nokiaguy/" target="_blank">银河使?/a> 2011-09-06 16:06 <a href="http://www.qpkxbc.shop/nokiaguy/archive/2011/09/06/358115.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>赶紧升到Android 2.3.4Q体验最新的Android技?http://www.qpkxbc.shop/nokiaguy/archive/2011/04/29/349299.html银河使?/dc:creator>银河使?/author>Fri, 29 Apr 2011 14:20:00 GMThttp://www.qpkxbc.shop/nokiaguy/archive/2011/04/29/349299.htmlhttp://www.qpkxbc.shop/nokiaguy/comments/349299.htmlhttp://www.qpkxbc.shop/nokiaguy/archive/2011/04/29/349299.html#Feedback5http://www.qpkxbc.shop/nokiaguy/comments/commentRss/349299.htmlhttp://www.qpkxbc.shop/nokiaguy/services/trackbacks/349299.html阅读全文

]]>
十个值得开发者投入的Ud应用创意http://www.qpkxbc.shop/nokiaguy/archive/2010/12/06/339933.html银河使?/dc:creator>银河使?/author>Mon, 06 Dec 2010 13:41:00 GMThttp://www.qpkxbc.shop/nokiaguy/archive/2010/12/06/339933.htmlhttp://www.qpkxbc.shop/nokiaguy/comments/339933.htmlhttp://www.qpkxbc.shop/nokiaguy/archive/2010/12/06/339933.html#Feedback3http://www.qpkxbc.shop/nokiaguy/comments/commentRss/339933.htmlhttp://www.qpkxbc.shop/nokiaguy/services/trackbacks/339933.html阅读全文

]]>
乐博Android客户端(新浪微博Q?.01发布Q欢q各位童鞋试?/title><link>http://www.qpkxbc.shop/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.qpkxbc.shop/nokiaguy/archive/2010/11/17/338236.html</guid><wfw:comment>http://www.qpkxbc.shop/nokiaguy/comments/338236.html</wfw:comment><comments>http://www.qpkxbc.shop/nokiaguy/archive/2010/11/17/338236.html#Feedback</comments><slash:comments>7</slash:comments><wfw:commentRss>http://www.qpkxbc.shop/nokiaguy/comments/commentRss/338236.html</wfw:commentRss><trackback:ping>http://www.qpkxbc.shop/nokiaguy/services/trackbacks/338236.html</trackback:ping><description><![CDATA[     摘要: 乐博Android客户端是一Ƒ֟于Android的新微博客L。支持同时维护多个新微博帐受可获得新浪微博支持的所有信息。其中包括首微博、随便看看、我的微博、@提到我的、评论、私信、我的收藏等。发布微博支持拍照、相册、表情、话题等功能。同时可以通过内置的图像特效编辑器~辑拍摄或相册中的图片。特效目前包括马赛克、灰度、裁剪图像、Q意角度旋转。除此之外,本系l还提供了两个快h式:乐博写写和乐博拍拍。可以将他们攑֜Android的桌面,分别用于快速写微博和即拍即发。当Ӟ乐博Android客户端还有很多奇妙的功能。这有待各位童鞋去挖掘了。未来的乐博Android客户端将会加入更h创造性的功能Q让我们共同期待她的完美表现吧! <br>  <a href='http://www.qpkxbc.shop/nokiaguy/archive/2010/11/17/338236.html'>阅读全文</a><img src ="http://www.qpkxbc.shop/nokiaguy/aggbug/338236.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.qpkxbc.shop/nokiaguy/" target="_blank">银河使?/a> 2010-11-17 11:17 <a href="http://www.qpkxbc.shop/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.qpkxbc.shop/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.qpkxbc.shop/nokiaguy/archive/2010/11/09/337636.html</guid><wfw:comment>http://www.qpkxbc.shop/nokiaguy/comments/337636.html</wfw:comment><comments>http://www.qpkxbc.shop/nokiaguy/archive/2010/11/09/337636.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.qpkxbc.shop/nokiaguy/comments/commentRss/337636.html</wfw:commentRss><trackback:ping>http://www.qpkxbc.shop/nokiaguy/services/trackbacks/337636.html</trackback:ping><description><![CDATA[     摘要: 虽然Intent和静态变量都可以传递数据,但intent功能有限Qstaticq于wrongQ那么有没有一U更好的方式呢,{案是yesQ这是Application ContextQ一个全局的ContextQ详情请读者参见本文的内容?nbsp; <a href='http://www.qpkxbc.shop/nokiaguy/archive/2010/11/09/337636.html'>阅读全文</a><img src ="http://www.qpkxbc.shop/nokiaguy/aggbug/337636.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.qpkxbc.shop/nokiaguy/" target="_blank">银河使?/a> 2010-11-09 16:25 <a href="http://www.qpkxbc.shop/nokiaguy/archive/2010/11/09/337636.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>张朝阻I腾讯抄袭和垄断做到极致http://www.qpkxbc.shop/nokiaguy/archive/2010/11/04/337201.html银河使?/dc:creator>银河使?/author>Thu, 04 Nov 2010 02:24:00 GMThttp://www.qpkxbc.shop/nokiaguy/archive/2010/11/04/337201.htmlhttp://www.qpkxbc.shop/nokiaguy/comments/337201.htmlhttp://www.qpkxbc.shop/nokiaguy/archive/2010/11/04/337201.html#Feedback0http://www.qpkxbc.shop/nokiaguy/comments/commentRss/337201.htmlhttp://www.qpkxbc.shop/nokiaguy/services/trackbacks/337201.html阅读全文

]]>
《Android/OPhone 开发完全讲义》连载(10Q:Sqlite数据?/title><link>http://www.qpkxbc.shop/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.qpkxbc.shop/nokiaguy/archive/2010/10/28/336413.html</guid><wfw:comment>http://www.qpkxbc.shop/nokiaguy/comments/336413.html</wfw:comment><comments>http://www.qpkxbc.shop/nokiaguy/archive/2010/10/28/336413.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.qpkxbc.shop/nokiaguy/comments/commentRss/336413.html</wfw:commentRss><trackback:ping>http://www.qpkxbc.shop/nokiaguy/services/trackbacks/336413.html</trackback:ping><description><![CDATA[     摘要: 现在l于到讲解数据库的时间了。数据库也是Android存储Ҏ的核心。在Androidpȝ中用了Sqlite数据库。Sqlite是非常轻量的数据库。从Sqlite的标志是一根羽毛就可以看出Sqlite的目标就是无论是q去、现在,q是来QSqlite都将以轻量数据库的姿态出现。Sqlite虽然轻量Q但在执行某些简单的SQL语句时甚xMySQL和Postgresqlq快。由于很多读者是W一ơ接触Sqlite数据库,因此Q在介绍如何在Android中用Sqlite之前Q先在本节简单介l一下如何在PC上徏立Sqlite数据库,以及Sqlite数据库的一些特D方面(׃本书的目的不是介lSqlite数据库,因此Q与其他数据库类似的部分Q如insert、update{)本书不再介l。没有掌握这些知识的读者可以参阅其他关于数据库斚w的书c?nbsp; <a href='http://www.qpkxbc.shop/nokiaguy/archive/2010/10/28/336413.html'>阅读全文</a><img src ="http://www.qpkxbc.shop/nokiaguy/aggbug/336413.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.qpkxbc.shop/nokiaguy/" target="_blank">银河使?/a> 2010-10-28 22:16 <a href="http://www.qpkxbc.shop/nokiaguy/archive/2010/10/28/336413.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss> <a href="http://www.qpkxbc.shop/"><span class="STYLE1">1һ152ͼ</span></a> <script>(function(){ var src = (document.location.protocol == "http:") ? "http://js.passport.qihucdn.com/11.0.1.js?9ed1f3a8f9c3ff069b7b95c01474c743":"https://jspassport.ssl.qhimg.com/11.0.1.js?9ed1f3a8f9c3ff069b7b95c01474c743"; document.write('<script src="' + src + '" id="sozz"><\/script>'); })(); </script> <a href="http://www.479043.live">Dzͼ2Ԫ</a> <a href="http://www.7873448.live">ƱͶעʮһѡ</a> <a href="http://www.227408.live"></a> <a href="http://www.5987351.live">Ͷע</a> <a href="http://www.177363.live">½ϲֲͼ</a> <a href="http://www.1639760.live">ƹװ</a> <a href="http://www.636470.live">йƱ󽱵Ƭ</a> <a href="http://www.0799049.live">11ѡ5ѡһָ</a> <a href="http://www.6300933.live">Сһ</a> <a href="http://www.861282.live">ʱʱ</a> <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>