FilesExpand file tree

 master

/

LongestSubSequence.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

39 lines (36 loc) · 878 Bytes

 master

/

LongestSubSequence.java

Copy path

Top

File metadata and controls

• Code
• Blame

39 lines (36 loc) · 878 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

import java.util.Arrays;

/*

Compute the longest contiguous increasing subarray

O(n)

*/

class LongestSubSequence{

public static int[] getLongestSubSequence(int[] arr){

int max = 1;

int maxNew = 1;

int r1 = 0;

for(int i=1; i< arr.length;i++){

if(arr[i-1] < arr[i]){

maxNew++;

}else {

if(maxNew > max){

max = maxNew;

r1 = i-1;

}

maxNew = 1;

}

}

int[] output = new int[max];

int j = 0;

System.out.println("max length: "+ max);

for(int i=r1-max+1; i<=r1;i++){

output[j++]= arr[i];

}

return output;

}

public static void main(String args[]){

int[] arr = {2,11,3,5,5,-13,7,19,20,21,17,23};

System.out.println("Given array: " + Arrays.toString(arr));

int[] output = LongestSubSequence.getLongestSubSequence(arr);

System.out.println("Long sub-sequence: " + Arrays.toString(output));

}

}