algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-29 15:34:21 +08:00
Code Issues Packages Projects Releases Wiki Activity

Refactor Code Style (#4151)

Browse Source
This commit is contained in:
Saurabh Rahate
2023-04-15 13:55:54 +05:30
committed by GitHub
parent 1ce907625b
commit 1dc388653a
100 changed files with 293 additions and 319 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/main/java/com/thealgorithms/dynamicprogramming/LongestAlternatingSubsequence.java
View File

@ -13,7 +13,7 @@ package com.thealgorithms.dynamicprogramming;
public class LongestAlternatingSubsequence {
/* Function to return longest alternating subsequence length*/
static int AlternatingLength(int arr[], int n) {
static int AlternatingLength(int[] arr, int n) {
/*
las[i][0] = Length of the longest
@ -28,7 +28,7 @@ public class LongestAlternatingSubsequence {
element
*/
int las[][] = new int[n][2]; // las = LongestAlternatingSubsequence
int[][] las = new int[n][2]; // las = LongestAlternatingSubsequence
for (int i = 0; i < n; i++) {
las[i][0] = las[i][1] = 1;
@ -61,7 +61,7 @@ public class LongestAlternatingSubsequence {
}
public static void main(String[] args) {
int arr[] = { 10, 22, 9, 33, 49, 50, 31, 60 };
int[] arr = { 10, 22, 9, 33, 49, 50, 31, 60 };
int n = arr.length;
System.out.println(
"Length of Longest " +