Java Exercises: Find the longest increasing continuous subsequence in a given array of integers
Java Basic: Exercise-178 with Solution
Write a Java program to find the longest increasing continuous subsequence in a given array of integers.
Sample Solution:
Java Code:
import java.util.*;
public class Solution {
public static void main(String[] args) {
int[] nums = { 10, 11, 12, 13, 14, 7, 8, 9, 1, 2, 3 };
System.out.println("Original array: " + Arrays.toString(nums));
System.out.println("Size of longest increasing continuous subsequence: " + longest_seq(nums));
}
public static int longest_seq(int[] nums) {
int max_sequ = 0;
if (nums.length == 1) return 1;
for (int i = 0; i < nums.length - 1; i++) {
int ctr = 1;
int j = i;
if (nums[i + 1] > nums[i]) {
while (j < nums.length - 1 && nums[j + 1] > nums[j]) {
ctr++;
j++;
}
} else if (nums[i + 1] < nums[i]) {
while (j < nums.length - 1 && nums[j + 1] < nums[j]) {
ctr++;
j++;
}
}
if (ctr > max_sequ) {
max_sequ = ctr;
}
i += ctr - 2;
}
return max_sequ;
}
}
Sample Output:
Original array: [10, 11, 12, 13, 14, 7, 8, 9, 1, 2, 3] Size of longest increasing continuous subsequence: 5
Pictorial Presentation:
Flowchart:

Java Code Editor:
Company: Facebook
Contribute your code and comments through Disqus.
Previous: Write a Java program to get a new binary tree with same structure and same value of a given binary tree.
Next: Write a Java program to plus one to the number of a given positive numbers represented as an array of digits.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
Java: Tips of the Day
Java: Anagrams
Generates all anagrams of a string.
public static List<String> anagrams(String input) { if (input.length() <= 2) { return input.length() == 2 ? Arrays.asList(input, input.substring(1) + input.substring(0, 1)) : Collections.singletonList(input); } return IntStream.range(0, input.length()) .mapToObj(i -> new SimpleEntry<>(i, input.substring(i, i + 1))) .flatMap(entry -> anagrams(input.substring(0, entry.getKey()) + input.substring(entry.getKey() + 1)) .stream() .map(s -> entry.getValue() + s)) .collect(Collectors.toList()); }
Ref: https://bit.ly/3rvAdAK
- Weekly Trends
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join
- JavaScript functions Exercises
- Python Tutorial
- Python Array Exercises
- SQL Cross Join
- C# Sharp Array Exercises