Read the input one line at a time and output the current line if and only if it is larger than any other line read so far or strictly smaller than the previously outputted line. (Here, smaller is with respect to the usual order on Strings, as defined by String.compareTo()). you have to use arrylist and cant modify any code under public static void main(string[] args). example: input 1 3 8 4 5 6 7 9 2 output: 1 3 8 4 9 2 import java.util.*; import java.io.BufferedReader; import java.io.FileReader; import java.io.FileWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.Stack; public class Part2 { /** * Your code goes here - see Part0 for an example * @param r the reader to read from * @param w the writer to write to * @throws IOException */ public static void doIt(BufferedReader r, PrintWriter w) throws IOException { /*ArrayList arr = new ArrayList<>(); int count = 0; String max = "0"; int len = 0; for (String line = r.readLine(); line != null; line = r.readLine()) { arr.add(line); if(arr.get(count).compareTo(max) > 0 ){ max = arr.get(count); w.println(arr.get(count)); } if(arr.get(count).length() > 1){ if(arr.size()> 1){ if(arr.get(count).length() >max.length()){ len = arr.get(count).length(); max = arr.get(count); w.println(arr.get(count)); System.out.println("1: " + arr.get(count)); } if(arr.get(count).length() == arr.get(count - 1).length()){ if(arr.get(count).length() >= len && arr.get(count).compareTo(max) > 0){ max = arr.get(count); w.println(arr.get(count)); System.out.println("2: " + arr.get(count)); } } if(arr.get(count -1).compareTo(max) == 0 && arr.get(count).compareTo(arr.get(count -1)) < 0){ w.println(arr.get(count)); System.out.println("3: " + arr.get(count)); } } } if(arr.size()> 1){ if(arr.get(count).length() < 2){ if(arr.get(count -1) == max && arr.get(count).compareTo(arr.get(count -1) )< 0){ w.println(arr.get(count)); System.out.println("4: " + arr.get(count)); } } } count++; }*/ //write your code here } /** * The driver. Open a BufferedReader and a PrintWriter, either from System.in * and System.out or from filenames specified on the command line, then call doIt. * @param args */ public static void main(String[] args) { try { BufferedReader r; PrintWriter w; if (args.length == 0) { r = new BufferedReader(new InputStreamReader(System.in)); w = new PrintWriter(System.out); } else if (args.length == 1) { r = new BufferedReader(new FileReader(args[0])); w = new PrintWriter(System.out); } else { r = new BufferedReader(new FileReader(args[0])); w = new PrintWriter(new FileWriter(args[1])); } long start = System.nanoTime(); doIt(r, w); w.flush(); long stop = System.nanoTime(); System.out.println("Execution time: " + 1e-9 * (stop-start)); } catch (IOException e) { System.err.println(e); System.exit(-1); } } }
Read the input one line at a time and output the current line if and only if it is larger than any other line read so far or strictly smaller than the previously outputted line. (Here, smaller is with respect to the usual order on Strings, as defined by String.compareTo()). you have to use arrylist and cant modify any code under public static void main(string[] args). example: input 1 3 8 4 5 6 7 9 2 output: 1 3 8 4 9 2 import java.util.*; import java.io.BufferedReader; import java.io.FileReader; import java.io.FileWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.Stack; public class Part2 { /** * Your code goes here - see Part0 for an example * @param r the reader to read from * @param w the writer to write to * @throws IOException */ public static void doIt(BufferedReader r, PrintWriter w) throws IOException { /*ArrayList arr = new ArrayList<>(); int count = 0; String max = "0"; int len = 0; for (String line = r.readLine(); line != null; line = r.readLine()) { arr.add(line); if(arr.get(count).compareTo(max) > 0 ){ max = arr.get(count); w.println(arr.get(count)); } if(arr.get(count).length() > 1){ if(arr.size()> 1){ if(arr.get(count).length() >max.length()){ len = arr.get(count).length(); max = arr.get(count); w.println(arr.get(count)); System.out.println("1: " + arr.get(count)); } if(arr.get(count).length() == arr.get(count - 1).length()){ if(arr.get(count).length() >= len && arr.get(count).compareTo(max) > 0){ max = arr.get(count); w.println(arr.get(count)); System.out.println("2: " + arr.get(count)); } } if(arr.get(count -1).compareTo(max) == 0 && arr.get(count).compareTo(arr.get(count -1)) < 0){ w.println(arr.get(count)); System.out.println("3: " + arr.get(count)); } } } if(arr.size()> 1){ if(arr.get(count).length() < 2){ if(arr.get(count -1) == max && arr.get(count).compareTo(arr.get(count -1) )< 0){ w.println(arr.get(count)); System.out.println("4: " + arr.get(count)); } } } count++; }*/ //write your code here } /** * The driver. Open a BufferedReader and a PrintWriter, either from System.in * and System.out or from filenames specified on the command line, then call doIt. * @param args */ public static void main(String[] args) { try { BufferedReader r; PrintWriter w; if (args.length == 0) { r = new BufferedReader(new InputStreamReader(System.in)); w = new PrintWriter(System.out); } else if (args.length == 1) { r = new BufferedReader(new FileReader(args[0])); w = new PrintWriter(System.out); } else { r = new BufferedReader(new FileReader(args[0])); w = new PrintWriter(new FileWriter(args[1])); } long start = System.nanoTime(); doIt(r, w); w.flush(); long stop = System.nanoTime(); System.out.println("Execution time: " + 1e-9 * (stop-start)); } catch (IOException e) { System.err.println(e); System.exit(-1); } } }
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Read the input one line at a time and output the current line if and only if it is larger
than any other line read so far or strictly smaller than the previously outputted line. (Here,
smaller is with respect to the usual order on Strings, as defined by String.compareTo()). you have to use arrylist and cant modify any code under public static void main(string[] args).
example: input
1
3
8
4
5
6
7
9
2
output:
1
3
8
4
9
2
import java.util.*;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Stack;
public class Part2 {
/**
* Your code goes here - see Part0 for an example
* @param r the reader to read from
* @param w the writer to write to
* @throws IOException
*/
public static void doIt(BufferedReader r, PrintWriter w) throws IOException {
/*ArrayList<String> arr = new ArrayList<>();
int count = 0;
String max = "0";
int len = 0;
for (String line = r.readLine(); line != null; line = r.readLine()) {
arr.add(line);
if(arr.get(count).compareTo(max) > 0 ){
max = arr.get(count);
w.println(arr.get(count));
}
if(arr.get(count).length() > 1){
if(arr.size()> 1){
if(arr.get(count).length() >max.length()){
len = arr.get(count).length();
max = arr.get(count);
w.println(arr.get(count));
System.out.println("1: " + arr.get(count));
}
if(arr.get(count).length() == arr.get(count - 1).length()){
if(arr.get(count).length() >= len && arr.get(count).compareTo(max) > 0){
max = arr.get(count);
w.println(arr.get(count));
System.out.println("2: " + arr.get(count));
}
}
if(arr.get(count -1).compareTo(max) == 0 && arr.get(count).compareTo(arr.get(count -1)) < 0){
w.println(arr.get(count));
System.out.println("3: " + arr.get(count));
}
}
}
if(arr.size()> 1){
if(arr.get(count).length() < 2){
if(arr.get(count -1) == max && arr.get(count).compareTo(arr.get(count -1) )< 0){
w.println(arr.get(count));
System.out.println("4: " + arr.get(count));
}
}
}
count++;
}*/
//write your code here
}
/**
* The driver. Open a BufferedReader and a PrintWriter, either from System.in
* and System.out or from filenames specified on the command line, then call doIt.
* @param args
*/
public static void main(String[] args) {
try {
BufferedReader r;
PrintWriter w;
if (args.length == 0) {
r = new BufferedReader(new InputStreamReader(System.in));
w = new PrintWriter(System.out);
} else if (args.length == 1) {
r = new BufferedReader(new FileReader(args[0]));
w = new PrintWriter(System.out);
} else {
r = new BufferedReader(new FileReader(args[0]));
w = new PrintWriter(new FileWriter(args[1]));
}
long start = System.nanoTime();
doIt(r, w);
w.flush();
long stop = System.nanoTime();
System.out.println("Execution time: " + 1e-9 * (stop-start));
} catch (IOException e) {
System.err.println(e);
System.exit(-1);
}
}
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education