Skip to content

Мимика Максим. Задание 03_11 #8978

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
mimikamaxim wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Мимика Максим. Задание 03_11 #8978

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 17 additions & 1 deletion 03-java-control-flow-and-arrays/task11/src/com.example.task11/Task11Main.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,8 @@
package com.example.task11;

import java.util.Arrays;
import java.util.NoSuchElementException;

public class Task11Main {
public static void main(String[] args) {
//здесь вы можете вручную протестировать ваше решение, вызывая реализуемый метод и смотря результат
Expand All @@ -12,7 +15,20 @@ public static void main(String[] args) {
}

static void swap(int[] arr) {
//todo напишите здесь свою корректную реализацию этого метода, вместо существующей
int min;
try {
min = Arrays.stream(arr).min().getAsInt();
} catch (Exception e) {
return;
}
int indexOfMin = lastIndexMin(arr, min);
int swap = arr[0];
arr[indexOfMin] = swap;
arr[0] = min;
}

static int lastIndexMin(int[] arr, int min) throws NoSuchElementException {
for (int i = arr.length - 1; i >= 0; i--) if (arr[i] == min) return i;
throw new NoSuchElementException("The is no element: " + min);
}
}