﻿<?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/sandy/CommentsRSS.aspx</link><description>Just a software engineer</description><language>zh-cn</language><pubDate>Sun, 23 Jun 2013 02:26:55 GMT</pubDate><lastBuildDate>Sun, 23 Jun 2013 02:26:55 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 子序列计数</title><link>http://www.blogjava.net/sandy/archive/2013/06/12/398467.html#400494</link><dc:creator>初学者：阿古</dc:creator><author>初学者：阿古</author><pubDate>Wed, 12 Jun 2013 15:56:00 GMT</pubDate><guid>http://www.blogjava.net/sandy/archive/2013/06/12/398467.html#400494</guid><description><![CDATA[<br>7.字符串String str = “ABCDEABCDABC”;定义一个方法query，8.该方法算出该字符串中每一个字符的个数，9.打印格式如：<br>A——3<br>B——3<br>C——3<br>D——2<br>E——1<br><img src ="http://www.blogjava.net/sandy/aggbug/400494.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/sandy/" target="_blank">初学者：阿古</a> 2013-06-12 23:56 <a href="http://www.blogjava.net/sandy/archive/2013/06/12/398467.html#400494#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 交叉字符串[未登录]</title><link>http://www.blogjava.net/sandy/archive/2013/05/15/398754.html#399317</link><dc:creator>wang</dc:creator><author>wang</author><pubDate>Wed, 15 May 2013 10:57:00 GMT</pubDate><guid>http://www.blogjava.net/sandy/archive/2013/05/15/398754.html#399317</guid><description><![CDATA[交叉字符串是用来干嘛的<img src ="http://www.blogjava.net/sandy/aggbug/399317.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/sandy/" target="_blank">wang</a> 2013-05-15 18:57 <a href="http://www.blogjava.net/sandy/archive/2013/05/15/398754.html#399317#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 交叉字符串</title><link>http://www.blogjava.net/sandy/archive/2013/05/13/398754.html#399204</link><dc:creator>javanewer</dc:creator><author>javanewer</author><pubDate>Mon, 13 May 2013 03:23:00 GMT</pubDate><guid>http://www.blogjava.net/sandy/archive/2013/05/13/398754.html#399204</guid><description><![CDATA[boolean[][] result = new boolean[l1+1][l2+1];<br>这一句什么作用？<img src ="http://www.blogjava.net/sandy/aggbug/399204.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/sandy/" target="_blank">javanewer</a> 2013-05-13 11:23 <a href="http://www.blogjava.net/sandy/archive/2013/05/13/398754.html#399204#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 交叉字符串</title><link>http://www.blogjava.net/sandy/archive/2013/05/12/398754.html#399182</link><dc:creator>tb</dc:creator><author>tb</author><pubDate>Sun, 12 May 2013 13:09:00 GMT</pubDate><guid>http://www.blogjava.net/sandy/archive/2013/05/12/398754.html#399182</guid><description><![CDATA[算法 对我有点启发  谢谢 <img src ="http://www.blogjava.net/sandy/aggbug/399182.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/sandy/" target="_blank">tb</a> 2013-05-12 21:09 <a href="http://www.blogjava.net/sandy/archive/2013/05/12/398754.html#399182#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 交叉字符串</title><link>http://www.blogjava.net/sandy/archive/2013/05/11/398754.html#399138</link><dc:creator>开发吧</dc:creator><author>开发吧</author><pubDate>Sat, 11 May 2013 02:19:00 GMT</pubDate><guid>http://www.blogjava.net/sandy/archive/2013/05/11/398754.html#399138</guid><description><![CDATA[今天正在搞这个问题，谢谢啦！<img src ="http://www.blogjava.net/sandy/aggbug/399138.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/sandy/" target="_blank">开发吧</a> 2013-05-11 10:19 <a href="http://www.blogjava.net/sandy/archive/2013/05/11/398754.html#399138#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 包围的区域</title><link>http://www.blogjava.net/sandy/archive/2013/04/22/397875.html#398222</link><dc:creator>小明</dc:creator><author>小明</author><pubDate>Mon, 22 Apr 2013 10:05:00 GMT</pubDate><guid>http://www.blogjava.net/sandy/archive/2013/04/22/397875.html#398222</guid><description><![CDATA[@cintana<br><br>谢谢，确实，我想复杂了<br><img src ="http://www.blogjava.net/sandy/aggbug/398222.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/sandy/" target="_blank">小明</a> 2013-04-22 18:05 <a href="http://www.blogjava.net/sandy/archive/2013/04/22/397875.html#398222#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 包围的区域</title><link>http://www.blogjava.net/sandy/archive/2013/04/22/397875.html#398189</link><dc:creator>cintana</dc:creator><author>cintana</author><pubDate>Mon, 22 Apr 2013 02:43:00 GMT</pubDate><guid>http://www.blogjava.net/sandy/archive/2013/04/22/397875.html#398189</guid><description><![CDATA[貌似太复杂了，为啥不直接扫描边上的‘o'呢，一下就解决了。<img src ="http://www.blogjava.net/sandy/aggbug/398189.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/sandy/" target="_blank">cintana</a> 2013-04-22 10:43 <a href="http://www.blogjava.net/sandy/archive/2013/04/22/397875.html#398189#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 有点难度的java笔试题[未登录]</title><link>http://www.blogjava.net/sandy/archive/2013/04/18/390916.html#398009</link><dc:creator>Harry</dc:creator><author>Harry</author><pubDate>Thu, 18 Apr 2013 02:19:00 GMT</pubDate><guid>http://www.blogjava.net/sandy/archive/2013/04/18/390916.html#398009</guid><description><![CDATA[right. I forgot that part... in order to search current folder, we have to give it '-cp .'<img src ="http://www.blogjava.net/sandy/aggbug/398009.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/sandy/" target="_blank">Harry</a> 2013-04-18 10:19 <a href="http://www.blogjava.net/sandy/archive/2013/04/18/390916.html#398009#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 有点难度的java笔试题</title><link>http://www.blogjava.net/sandy/archive/2013/04/18/390916.html#398002</link><dc:creator>小明</dc:creator><author>小明</author><pubDate>Thu, 18 Apr 2013 01:32:00 GMT</pubDate><guid>http://www.blogjava.net/sandy/archive/2013/04/18/390916.html#398002</guid><description><![CDATA[@Harry<br><br>The answer of question is b<br><br>b) If user doesn’t specify classpath, the JVM search the class from the current folder by default.<br><br>JVM doesn't search the class from the current folder by default.<br><img src ="http://www.blogjava.net/sandy/aggbug/398002.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/sandy/" target="_blank">小明</a> 2013-04-18 09:32 <a href="http://www.blogjava.net/sandy/archive/2013/04/18/390916.html#398002#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 回文字符串的切割问题[未登录]</title><link>http://www.blogjava.net/sandy/archive/2013/04/17/397689.html#397964</link><dc:creator>Harry</dc:creator><author>Harry</author><pubDate>Wed, 17 Apr 2013 04:39:00 GMT</pubDate><guid>http://www.blogjava.net/sandy/archive/2013/04/17/397689.html#397964</guid><description><![CDATA[object Palindrome {<br>  def isPelindrome(l:String):Boolean = {<br>    val fhalf = l.take(l.length/2)<br>    val shalf = l.takeRight(l.length/2).reverse<br>    if (fhalf==shalf) true else false<br>  }<br>  def minCut(s:String,partition:Int):Int = {<br>    val ss = s.take(partition)<br>    val ts = s.takeRight(s.length - partition)<br>    if (isPelindrome(ss)&amp;&amp;isPelindrome(ts)) 1 else 0<br>  }<br>  def main(args: Array[String]): Unit = {<br>    val stime = System.currentTimeMillis()<br>    val t = {for (i &lt;- 1 to 14000) yield &quot;a&quot;}.foldLeft(&quot;&quot;){case (c,s)=&gt; s+c}<br>    val r = for (i &lt;- 1 to t.size) yield minCut(t,i)<br>    println(r.sum)<br>    println(System.currentTimeMillis() - stime)<br>  }<br><br>}<br><br>result: 14,000 &quot;a&quot;, takes 2669 ms<img src ="http://www.blogjava.net/sandy/aggbug/397964.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/sandy/" target="_blank">Harry</a> 2013-04-17 12:39 <a href="http://www.blogjava.net/sandy/archive/2013/04/17/397689.html#397964#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>