2012年8月14日
Some Efficient Algorithms
摘要： 1. For Integer,you can consider the following: *2 ≡ <<1 /2≡>>1 %2 ≡ &12.Generate anon-repeating numbers random arrayranging from 1-50 int[] result = new int[50]; ArrayList<Integer> numPool = new ArrayList<Integer>(); for (int i = 0; i < 50; i++) { numPool.add(i); ... 阅读全文
posted @ 2012-08-14 10:45 Qiengo 阅读(134) 评论(0) 推荐(0)