世界到处都是小星星

2015年5月

摘要： processhttp://scikit-learn.org/dev/tutorial/basic/tutorial.htmlcodehttp://scikit-learn.org/dev/auto_examples/classification/plot_digits_classification... 阅读全文

posted @ 2015-05-14 11:57 世界到处都是小星星阅读(121) 评论(0) 推荐(0)

python 和scikit安装

摘要：安装python 和pip，注意一定要添加路径 check, 如youtube所示https://www.youtube.com/watch?v=yHtFeEZEexchttp://arunrocks.com/guide-to-install-python-or-pip-on-windows/用pi... 阅读全文

posted @ 2015-05-14 08:31 世界到处都是小星星阅读(136) 评论(0) 推荐(0)

java 基础： interface 和abstract

摘要： http://blog.csdn.net/zhandoushi1982/article/details/8458081 阅读全文

posted @ 2015-05-08 12:14 世界到处都是小星星阅读(76) 评论(0) 推荐(0)

primeNumber

摘要： public class primeNum { public static void main(String[] args) { // TODO Auto-generated method stub int N =100; boolean[] a=new boolean[N+1]... 阅读全文

posted @ 2015-05-07 06:56 世界到处都是小星星阅读(231) 评论(0) 推荐(0)

Linux Network Administrators Guide

摘要： http://www.tldp.org/LDP/nag2/index.html 阅读全文

posted @ 2015-05-06 05:49 世界到处都是小星星阅读(126) 评论(0) 推荐(0)

2015年4月

Hashtable vs. HashMap

摘要： http://beginnersbook.com/2014/06/difference-between-hashmap-and-hashtable/http://www.importnew.com/7010.html 阅读全文

posted @ 2015-04-28 11:20 世界到处都是小星星阅读(95) 评论(0) 推荐(0)

How to find more or better bugs (12 tips to explode your bug count and/ or severity)?

摘要： refhttp://inderpsingh.blogspot.com/2010/03/how-to-find-more-or-better-bugs-12-tips.htmlI copied directlyWell, we know that we do not find all the bugs... 阅读全文

posted @ 2015-04-28 11:19 世界到处都是小星星阅读(155) 评论(0) 推荐(0)

Happy Number

摘要：我觉得这个算法比较陌生，对我不是简单题目public class Solution { public boolean isHappy(int n) { // 这个叫“模拟”的算法是什么http://meetqun.com/thread-8853-1-1.html H... 阅读全文

posted @ 2015-04-24 12:54 世界到处都是小星星阅读(155) 评论(0) 推荐(0)

Fraction to Recurring Decimal

摘要：注意有很多地方关于long 和int的处理比如赋值n, d判断是否应该是负数的时候如果写成long n = (long) numerator>0? numerator: -numerator;long d = (long) denominator>0? denominator:-denominato... 阅读全文

posted @ 2015-04-24 12:27 世界到处都是小星星阅读(295) 评论(0) 推荐(0)

Longest Substring with At Most Two Distinct Characters

摘要： Given a string S, find the length of the longest substring T that contains at most two distinct characters.Given S = “eceba”,T is “ece” which its leng... 阅读全文

posted @ 2015-04-24 06:34 世界到处都是小星星阅读(414) 评论(0) 推荐(0)