Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Random;
- public class diagonalni_matice {
- static java.util.Scanner sc=new java.util.Scanner(System.in);
- /**
- * 6. Napište metodu, která vygeneruje matici,
- * kde se budou vyskytovat prvky pouze na diagonale (ostatni prvky budou nulové).
- * Na diagonále pak nalezěte max. a min. prvek.
- * Vypište celou matici spolu s nalezenou max. a min. hodnotou.
- */
- public static void main(String[] args) {
- int cislo=0;
- int [][] dvoupole = {{cislo,0,0},{0,cislo,0},{0,0,cislo}}; //tady by se to asi dalo napsat lepe
- vypis (dvoupole);
- System.out.println("");
- System.out.println("maximum je "+linearnimax(dvoupole));
- System.out.println("minimum je "+linearnimin(dvoupole));
- }
- static int[][] generator (int cislo, int [][] pole){
- Random generator = new Random(); //tady bude určitě kámen urazu
- for (int i=0; i<pole.length; i++){
- for (int j=1; j<pole[i].length; j++) {
- cislo[][] = generator.nextInt();
- }
- }
- return cislo;
- }
- static void vypis (int[][]dvoupole){
- for(int i=0; i<dvoupole.length; i++){
- System.out.println ("");
- for(int j=0; j<dvoupole[i].length; j++){
- System.out.print(" "+ dvoupole[i][j]);
- }
- }
- }
- static int linearnimax(int [][] pole) {
- int max=pole[0][0];
- for (int i=1; i<pole.length; i++){
- for (int j=1; j<pole[i].length; j++) {
- if (max<pole[i][j]){ max=pole[i][j];}
- }
- }
- return max;
- }
- static int linearnimin(int [][] pole) { //tady to potrebuje poresit ty nuly, ale to az nakonec
- int min=pole[0][0];
- for (int i=1; i<pole.length; i++){
- for (int j=1; j<pole[i].length; j++) {
- if (min>pole[i][j]){ min=pole[i][j];}
- }
- }
- return min;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement