Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Scanner;
- public class EX3 {
- public static Scanner input = new Scanner(System.in);
- public static void main(String[] args) {
- int x,y;
- do{
- x = input.nextInt();
- }while(x<=0);
- do{
- y = input.nextInt();
- } while(y<=0);
- int mat[][] = preencher(x,y);
- int m[][]=ordenar1(mat,x,y);
- ordenar2(m);
- }
- public static int[][] preencher(int x, int y){
- int mat[][] = new int [x][y];
- for (int i = 0; i < mat.length; i++) {
- for (int j = 0; j < mat[i].length; j++) {
- mat[i][j] = input.nextInt();
- }
- }
- System.out.println("Matriz");
- for (int i = 0; i < mat.length; i++) {
- String Linha ="";
- for (int j = 0; j < mat[i].length; j++) {
- Linha = Linha + mat[i][j]+" ";
- }
- System.out.println(Linha);
- }
- return mat;
- }
- public static void ordenar2(int m[][]){
- int temp1,temp2;
- for (int i = m[0].length-1; i > 0; i--) {
- for (int j = 0; j < i; j++) {
- if ( m[1][j] < m[1][j+1] ) {
- temp1=m[0][j];
- temp2=m[1][j];
- m[0][j]=m[0][j+1];
- m[1][j]=m[1][j+1];
- m[0][j+1]=temp1;
- m[1][j+1]=temp2;
- }
- }
- }
- System.out.println("Frequencia");
- for (int i = 0; i < m.length; i++) {
- String Linha ="";
- for (int j = 0; j < m[i].length; j++) {
- Linha = Linha + m[i][j]+" ";
- }
- System.out.println(Linha);
- }
- }
- public static int[][] ordenar1(int [][] mat, int x, int y){
- int vet1[] = new int[x*y];
- for (int i = 0; i < vet1.length; i++) {
- vet1[i]=-100;
- }
- int k=0;
- int h =0;
- int cont=0;
- for (int i = 0; i < mat.length; i++) {
- for (int j = 0; j < mat[i].length; j++) {
- k=0;
- for (int m = 0; m < vet1.length; m++) {
- if (mat[i][j] == (vet1[m])){
- k++;
- }
- }
- if (k==0){
- vet1[h] = mat[i][j];
- h++;
- }
- }
- }
- int vet2[] = new int[h];
- for (int l = 0; l < vet2.length; l++) {
- for (int i = 0; i < mat.length; i++) {
- for (int j = 0; j < mat[i].length; j++){
- if ( vet1[l] == mat[i][j]){
- cont++;
- }
- }
- }
- vet2[l]=cont;
- cont=0;
- }
- int m[][]= new int [2][h];
- for (int i = 0; i < m[0].length; i++) {
- m[0][i] = vet1[i];
- }
- for (int i = 0; i < m[1].length; i++) {
- m[1][i] = vet2[i];
- }
- return m;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement