2014年9月17日
1063. Set Similarity (25)
摘要： the problem is from PAT,which website is http://pat.zju.edu.cn/contests/pat-a-practise/1063 At first, i decide use a for loop to get the intersection, which time complexity is O(n * log(n)) ,but it t... 阅读全文
posted @ 2014-09-17 16:42 maverick_fu 阅读(171) 评论(0) 推荐(0)