FilesExpand file tree

 master

/

HIndexII.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

44 lines (42 loc) · 954 Bytes

 master

/

HIndexII.java

Copy path

Top

File metadata and controls

• Code
• Blame

44 lines (42 loc) · 954 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

package binary_search;

/**

* Created by gouthamvidyapradhan on 11/12/2017.

*

* <p>Follow up for H-Index: What if the citations array is sorted in ascending order? Could you

* optimize your algorithm?

*

* @see array.HIndex

*/

public class HIndexII {

/**

* Main method

*

* @param args

* @throws Exception

*/

public static void main(String[] args) throws Exception {

int[] A = {1, 1, 1, 1, 1, 15, 20};

System.out.println(new HIndexII().hIndex(A));

}

public int hIndex(int[] citations) {

if (citations.length == 0) return 0;

int s = 0, e = citations.length;

int ans = -1;

while (s < e) {

int m = (s + e) >>> 1;

int cit = citations.length - m;

if (citations[m] > cit) {

if (ans < cit) {

ans = cit;

}

e = m;

} else {

if (ans < citations[m]) {

ans = citations[m];

}

s = m + 1;

}

}

return ans;

}

}