Have a Question sli do TODO 2 2

Have a Question? sli. do #TODO 2

Увеличаване (2) § Пре-инкрементация int a = 1; System. out. print(++a); // 2 System. out. print(a); // 2 § Пост-инкрементация int a = 1; System. out. print(a++); // 1 System. out. print(a); // 2 6

Намаляване (2) § Пре-декрементация int a = 1; System. out. print(--a); // 0 System. out. print(a); // 0 § Пост-декрементация int a = 1; System. out. print(a--); // 1 System. out. print(a); // 0 8

Сумиране на числа - решение Scanner scanner = new Scanner(System. in); int n = Integer. parse. Int(scanner. next. Line()); int sum = 0; for (int i = int num = sum } Можем да четем данни в цикъл 0; i < n; i++) { Integer. parse. Int(scanner. next. Line()); + num; System. out. println("sum = " + sum); Тестване на решението: https: //judge. softuni. bg/Contests/Practice/Index/154#3 16

Най-голямо число - решение Scanner scanner = new Scanner(System. in); int n = Integer. parse. Int(scanner. next. Line()); int max = Integer. MIN_VALUE; for (int i = 1; i <= n; i++) { int num = Integer. parse. Int(scanner. next. Line()); if (num > max) { max = num; } } System. out. println("max = " + max); Тестване на решението: https: //judge. softuni. bg/Contests/Practice/Index/154#4 18

Най-малко число - решение Scanner scanner = new Scanner(System. in); int n = Integer. parse. Int(scanner. next. Line()); int min = Integer. MAX_VALUE; //TODO: Use logic similar to the previous problem Тестване на решението: https: //judge. softuni. bg/Contests/Practice/Index/154#4 20

Решение: лява и дясна сума Scanner scanner = new Scanner(System. in); int n = Integer. parse. Int(scanner. next. Line()); int left. Sum = 0; for (int i = 0; i < n * 2; i++) left. Sum = left. Sum + Integer. parse. Int(scanner. next. Line()); // TODO: read and calculate the right. Sum if (left. Sum == right. Sum) System. out. println("Yes, sum = " + left. Sum); else System. out. println("No, diff = " + Math. Abs(right. Sum - left. Sum)); Тестване на решението: https: //judge. softuni. bg/Contests/Practice/Index/154#6 25

Решение: четна / нечетна сума Scanner scanner = new Scanner(System. in); int n = Integer. parse. Int(scanner. next. Line()); int odd. Sum = 0; int even. Sum = 0; for (int i = 0; i < n; i++) { int element = Integer. parse. Int(scanner. next. Line()); if (i % 2 == 0) odd. Sum += element; else even. Sum += element; } // TODO: print the sum / difference Тестване на решението: https: //judge. softuni. bg/Contests/Practice/Index/154#7 28

Сумиране на гласни букви - решение Scanner scanner = new Scanner(System. in); String input = scanner. next. Line(); int sum = 0; for (int i = 0; i < s. length(); i++) { switch (input. char. At(i)) { case 'a': sum += 1; break; case 'e': sum += 2; break; // TODO: Add cases for other vowels. } } System. out. println("Vowels sum = " + sum); Тестване на решението: https: //judge. softuni. bg/Contests/Practice/Index/154#8 30

Какво научихме днес? (2) § Можем да четем поредица от n числа от конзолата: int n = Integer. parse. Int(scanner. next. Line()); for (int i = 0; i < n; i++) { int num = Integer. parse. Int(scanner. next. Line()); … } § Можем да вземем символ по индекс от текст String text = "text"; char symbol = text. char. At(2); System. out. println(symbol); // x 33

Повторения (цикли) ? ? ? и с про Въ ? ? ? https: //softuni. bg/courses/programming-basics/