a530552571的专栏

Repeated DNA Sequences All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes useful to identify rep

Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. For example, Given nums = [0, 1, 3] return 2. Note: Your algorithm shoul

Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm? 思路：参考H-Index的思路，只是这次不需要再进行排序操作了，复杂度为O（n），代码如下： public int hIndex(int[] citat