Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package Laba7;
- public interface FileExpression {
- void modification();
- }
- ///////////
- package Laba7;
- public class FileLambda {
- public static void mod(FileExpression expression){
- expression.modification();
- }
- }
- ////////////
- package Laba7;
- import java.io.File;
- import java.io.FileNotFoundException;
- import java.io.PrintWriter;
- import java.util.ArrayList;
- import java.util.Comparator;
- import java.util.List;
- import java.util.Scanner;
- public class Main {
- public static void main(String[] args) throws FileNotFoundException {
- PrintWriter p1=new PrintWriter("One.txt");
- PrintWriter p2=new PrintWriter("Two.txt");
- PrintWriter p3=new PrintWriter("Three.txt");
- Scanner read1=new Scanner(new File("Read.txt"));
- List<Integer> numbers=new ArrayList<>();
- FileLambda.mod(() -> { //сортировка по возрастанию
- while (read1.hasNext()){
- numbers.add(read1.nextInt());
- }
- numbers.sort((Comparator<Integer>) (o1, o2) -> o1.compareTo(o2));
- p1.println("Sort increase:\n"+numbers);
- read1.close();
- p1.close();
- });
- FileLambda.mod(() -> { //сортировка по убыванию
- numbers.sort((Comparator<Integer>) (o1, o2) -> o2.compareTo(o1));
- p2.println("Sort decrease:\n"+numbers);
- p2.close();
- });
- FileLambda.mod(() -> { //сортировка по убыванию
- int max=0;
- int min=10000;
- for(int value:numbers){
- if(value>max)
- max=value;
- if(value<min)
- min=value;
- }
- p3.printf("List max value: %s\nList min value: %s",max,min);
- p3.close();
- });
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement