2014年12月13日

Lintcode: First Bad Version 解题报告
摘要： First Bad Version http://lintcode.com/en/problem/first-bad-versionThe code base version is an integer and start from 1 to n. One day, someone commit... 阅读全文
posted @ 2014-12-13 20:56 Yu's Garden 阅读(6348) 评论(0) 推荐(0)
九章面试题：Find first K frequency numbers 解题报告
摘要： Find first K frequency numbers/** Input: int[] A = {1, 1, 2, 3, 4, 5, 2}; k = 3* return the highest frequency numbers.* return: [1, 2, 3] or [1, 2, 4]... 阅读全文
posted @ 2014-12-13 00:07 Yu's Garden 阅读(476) 评论(0) 推荐(0)

导航