ztao2333的博客

原创 Java中如何遍历Map对象的4种方法

http://blog.csdn.net/tjcyjd/article/details/11111401

原创 Java中如何遍历Map对象的4种方法

原创 获取两个数组的交集

[code="java"] /* finds the intersection of * two arrays in a simple fashion. * * PARAMS * a - first array, must already be sorted * b - second array, must already be sorted * * NOTE...

原创 获取两个数组的交集

S * * Should have O(n) operations, where n is * n = MIN(a.length(), b.length()) */ //两个数组必须先排序 function arrayIntersection(a, b){ var ai=0, bi=0; var result = new Array(); while( ai < a.length && bi < b.length ){ if (a[