lothar.buchholz/find-longest-distinct-subarray
0
0
Fork 0
forked from code-clash/find-longest-distinct-subarray
Code Issues Pull Requests Releases Wiki Activity

optimized sample solution

Browse Source
This commit is contained in:
Lothar Buchholz 2020-05-16 22:14:58 +02:00
parent f876f51e51
commit d5ad7082a1
2 changed files with 31 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

47
src/main/java/Solution.java
View File

@ -1,27 +1,34 @@
import java.util.*;
import java.io.*;
import java.math.*;
import org.apache.commons.collections4.*;
import org.apache.commons.lang3.*;
import org.apache.commons.math3.*;
/**
* Template code to help you parse the standard input
* Template code to help you parse the standard input
* according to the problem statement.
**/
class Solution {
public static void main( String[] args ) {
// hint: read values via Scanner methods
Scanner in = new Scanner( System.in );
// code your solution here
// use error to write to console
System.err.println( "debug" );
// Write result with System.out.println()
System.out.println( "value" );
}
public static void main( String[] args ) {
// hint: read values via Scanner methods
var scanner = new Scanner( System.in );
// code your solution here
Map<String, Integer> lastOccurrences = new HashMap<>();
int startIndex = 0;
int maxLength = 0;
int index = 0;
while ( scanner.hasNext() ) {
Integer previousOccurrence = lastOccurrences.put( scanner.next(), index++ );
if ( previousOccurrence != null ) {
if ( previousOccurrence >= startIndex ) {
maxLength = Math.max( maxLength, index - 1 - startIndex );
startIndex = previousOccurrence + 1;
}
}
}
maxLength = Math.max( maxLength, index - startIndex );
// Write result with System.out.println()
System.out.println( maxLength );
}
}

4
src/test/resources/testdata.csv
View File

@ -2,6 +2,10 @@ a, 1
a b, 2
a a, 1
f s f e t w e n w e, 5
s f e t w s l o p q r, 10
s f e t w s f e t l o, 7
s f e t w s w t e f s, 5
s f e t w s w t e f s l, 6
k i u w y x f l e c g, 11
b u e v l w u d t r a b q x a h x b y s y w w s k, 12
z d k g x p a f h b c p y r y o r y k k o n u t h, 11

1 a 1
2 a b 2
3 a a 1
4 f s f e t w e n w e 5
5 s f e t w s l o p q r 10
6 s f e t w s f e t l o 7
7 s f e t w s w t e f s 5
8 s f e t w s w t e f s l 6
9 k i u w y x f l e c g 11
10 b u e v l w u d t r a b q x a h x b y s y w w s k 12
11 z d k g x p a f h b c p y r y o r y k k o n u t h 11