Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /**
- * Created by sNow on 02.07.2015.
- */
- import java.util.List;
- import java.util.ArrayList;
- import java.util.Scanner;
- public class Main {
- static Scanner get = new Scanner(System.in);
- public static void main(String[] args) {
- System.out.printf("Введите размер массивов: ");
- int n = get.nextInt();
- System.out.println("\nМассив строк:");
- Solution(n);
- }
- public static void Solution(int n) {
- ArrayList<String> array = new ArrayList<>();
- int i;
- int[] mass = new int[n];
- for (i = 0; i < n; i++) {
- System.out.printf("Введите %d строку: ", i);
- array.add(get.next());
- mass[i] = array.get(i).length();
- }
- System.out.println();
- for (i = 0; i < n; i++) {
- System.out.printf("Размер %d строки = %s\n", i, mass[i]);
- }
- System.out.printf("\nМаксимальная длина строки = %d\n", max(mass, n));
- System.out.printf("Минимальная длина строки = %d", min(mass, n));
- }
- public static int max(int[] mass, int n) {
- int max = mass[0];
- for (int i = 0; i < n; i++) {
- if (max < mass[i]) max = mass[i];
- }
- return max;
- }
- public static int min(int[] mass, int n) {
- int min = mass[0];
- for (int i = 0; i < n; i++) {
- if (min > mass[i]) min = mass[i];
- }
- return min;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement