FilesExpand file tree

 master

/

MaximumGap.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

78 lines (67 loc) · 1.95 KB

 master

/

MaximumGap.java

Copy path

Top

File metadata and controls

• Code
• Blame

78 lines (67 loc) · 1.95 KB

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

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

package com.interview.array;

/**

* Date 03/12/2016

* @author Tushar Roy

*

* Given an unsorted array find maximum gap between consecutive element in sorted array.

*

* Time complexity O(n)

* Space complexity O(n)

*

* Reference

* https://leetcode.com/problems/maximum-gap/

*/

public class MaximumGap {

class Bucket {

int low ;

int high;

boolean isSet = false;

void update(int val) {

if (!isSet) {

low = val;

high = val;

isSet = true;

} else {

low = Math.min(low, val);

high = Math.max(high, val);

}

}

}

public int maximumGap(int[] input) {

if (input == null || input.length < 2) {

return 0;

}

int min = Integer.MAX_VALUE;

int max = Integer.MIN_VALUE;

for (int i = 0; i < input.length; i++) {

min = Math.min(min, input[i]);

max = Math.max(max, input[i]);

}

int gap = (int) Math.ceil((double) (max - min) / (input.length - 1));

Bucket[] buckets = new Bucket[input.length - 1];

for (int i = 0; i < buckets.length; i++) {

buckets[i] = new Bucket();

}

for (int i = 0; i < input.length; i++) {

if (input[i] == max || input[i] == min) {

continue;

}

buckets[(input[i] - min) / gap].update(input[i]);

}

int prev = min;

int maxGap = 0;

for (int i = 0; i < buckets.length; i++) {

if (!buckets[i].isSet) {

continue;

}

maxGap = Math.max(maxGap, buckets[i].low - prev);

prev = buckets[i].high;

}

return Math.max(maxGap, max - prev);

}

public static void main(String args[]) {

int[] input = {4, 3, 13, 2, 9, 7};

MaximumGap mg = new MaximumGap();

System.out.println(mg.maximumGap(input));

}

}