Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Prodentim Probiotics Specially Designed For The Health Of Your Teeth And Gums

Instant Grammar Checker - Correct all grammar errors and enhance your writing

Teach Your Child To Read

Powerful WordPress hosting for WordPress professionals

Disclosure: My content contains affiliate links.

31,166 questions

40,722 answers

573 users

How to find the longest increasing not sorted subsequence (LIS) of a sequence of numbers in Java

Booking.com | Official site | The best hotels, flights, car rentals & accommodations


95 views
asked Jun 8, 2019 by avibootz
edited Jun 8, 2019 by avibootz

1 Answer

0 votes
public class Main
{
	static int not_sorted_lis(int arr[], int len) {   
        int total = 1;   
         
        for (int i = 0; i < len - 1; i++ ) { 
            if (arr[i] < arr[i + 1]) {
               total++;
            }
            System.out.println(arr[i] + " " + arr[i + 1] + " " + " total = " + total);
        } 
       
        return total;
    }  
	public static void main(String[] args) {
		int arr[] = { 4, 5, 1, 10, 7, 9, 18, 19 }; 
     
        System.out.println("LIS length = " + not_sorted_lis(arr, arr.length));  
	}
}



/*
run:

4 5  total = 2 
5 1  total = 2 
1 10  total = 3
10 7  total = 3
7 9  total = 4 
9 18  total = 5
18 19  total = 6
LIS length = 6 

*/

 





answered Jun 8, 2019 by avibootz
...