Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public static leggyakoribb keres(int [][]t)
- {
- int m=0; int n=0; int elem=0;
- int max=0;
- for(int i=0;i<t.length;i++)
- {for(int j=0;j<t.length;j++)
- {int vizsgalt=t[i][j];
- int gyakori=0;
- for(i=0;i<t.length;i++)
- {for(j=0;j<t[i].length;j++)
- {if(vizsgalt==t[i][j])
- gyakori++;}}
- if(gyakori>max)
- {max=gyakori;
- elem=vizsgalt;
- m=i;
- n=j;}}
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement