Skip to content

Solution for Arrays 06 #75

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
wants to merge 2 commits into
base: exercises/arrays/06
Choose a base branch
from
Open

Solution for Arrays 06 #75

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
8be8c92
Implement solution
SteffenLm Oct 7, 2023
9dbca91
Google Java Format
Oct 7, 2023
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 Exercise.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,22 @@
public class Exercise {

public static void main(String[] args) {
// implement exercise here
int[][] input = {{5, 8, 2}, {9, 6, 10}, {10, 2, 7}, {1, 9, 5}};
int[][] output = new int[input.length][2];

for (int i = 0; i < input.length; i++) {
int min = input[i][0];
int max = input[i][0];
for (int j = 0; j < input[i].length; j++) {
max = (input[i][j] > max) ? input[i][j] : max;
min = (input[i][j] < min) ? input[i][j] : min;
}
output[i][0] = min;
output[i][1] = max;
}
System.out.println("MIN - MAX");
for (int i = 0; i < output.length; i++) {
System.out.println(output[i][0] + " - " + output[i][1]);
}
}
}