FilesExpand file tree

 master

/

Problem239.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

46 lines (40 loc) · 1.09 KB

 master

/

Problem239.java

Top

File metadata and controls

• Code
• Blame

46 lines (40 loc) · 1.09 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

class Problem239 {

public static void main(String[] args) {

int[] nums = {};

int k = 0;

int[] res = new Problem239().maxSlidingWindow(nums, k);

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

System.out.printf("%d, ", res[i]);

}

}

public int[] maxSlidingWindow(int[] nums, int k) {

if (k <= 0 || nums.length <= 0) return new int[]{};

int[] res = new int[nums.length-k+1];

res[0] = nums[0];

for (int i = 0; i < k; i++) {

if(res[0] < nums[i]) res[0] = nums[i];

}

int count = 1;

for (int j = k; j < nums.length; j++) {

if (nums[j] > res[count-1]) {

res[count] = nums[j];

} else {

// 判断时候移出

if (nums[j-k] == res[count-1]) {

// 循环查找

int p = j-k+1;

int max = nums[p];

while(p <= j) {

max = max < nums[p] ? nums[p] : max;

p++;

}

res[count] = max;

} else {

res[count] = res[count-1];

}

}

count++;

}

return res;

}

}