Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Random;
- public class Tablica2 {
- int[][] nTab2;
- int sizeX, sizeY;
- private Tablica2 (int x, int y) {
- sizeX = x;
- sizeY = y;
- nTab2 = new int[x][y];
- }
- private void tabFill(int k) {
- Random r = new Random();
- for (int i = 0; i < sizeX; i++) {
- for (int j = 0; j < sizeY; j++) {
- int ran = r.nextInt(k);
- nTab2[i][j] = ran;
- }
- }
- }
- private void tabDisplay() {
- System.out.println("");
- for (int i = 0; i < sizeX; i++) {
- for (int j = 0; j < sizeY; j++) {
- System.out.print(nTab2[i][j] + " ");
- if (j == sizeY-1) {
- System.out.print("\n");
- }
- }
- }
- System.out.println("");
- }
- private void tabDisplayTrans() {
- for (int i = 0; i < sizeY; i++) {
- for (int j = 0; j < sizeX; j++) {
- System.out.print(nTab2[j][i] + " ");
- if (j == sizeX-1) {
- System.out.print("\n");
- }
- }
- }
- System.out.println("");
- }
- private int tabSum() {
- int Sum = 0;
- for (int i = 0; i < sizeX; i++) {
- for (int j = 0; j < sizeY; j++) {
- Sum += nTab2[i][j];
- }
- }
- return Sum;
- }
- private void tabMaxEl() {
- int max = nTab2[0][0];
- int x = 0;
- int y = 0;
- for (int i = 0; i < sizeX; i++) {
- for (int j = 0; j < sizeY; j++) {
- if (nTab2[i][j] > max) {
- max = nTab2[i][j];
- x = i;
- y = j;
- }
- }
- }
- System.out.println("Najwieksza wartosc to " + max + ", na pozycji [" + x + ", " + y + "]");
- }
- public void tabFindEl(int nFind) {
- boolean found = false;
- for (int i = 0; i < sizeX; i++) {
- for (int j = 0; j < sizeY; j++) {
- if (nTab2[i][j] == nFind) {
- System.out.println("Znaleziono " + nFind + " na pozycji [" + i + ", " + j + "]");
- found = true;
- }
- }
- }
- if (found == false) System.out.println("[-1, -1]");
- }
- public int tabBiggestRow() {
- int maxRow = 0;
- int maxSum = 0;
- int currSum = 0;
- for (int i = 0; i < sizeX; i++) {
- currSum = 0;
- for (int j = 0; j < sizeY; j++) {
- currSum += nTab2[i][j];
- if (currSum > maxSum) {
- maxSum = currSum;
- maxRow = i;
- }
- }
- }
- System.out.println("Wiersz " + maxRow + " ma najwieksza sume " + maxSum);
- return maxRow;
- }
- public void tabDelRow(int DelRowNum) {
- int n = DelRowNum;
- for (int i = 0; i < sizeX; i++) {
- if (i == n && i != sizeX-1) {
- for (int j = 0; j < sizeY; j++) {
- nTab2[i][j] = nTab2[i+1][j];
- n++;
- }
- }
- }
- sizeX--;
- }
- public static void main(String[] args) {
- Tablica2 tab1 = new Tablica2(6, 5);
- tab1.tabFill(20);
- tab1.tabDisplay();
- tab1.tabDisplayTrans();
- System.out.println("Suma elementow: " + tab1.tabSum());
- tab1.tabMaxEl();
- tab1.tabFindEl(13);
- tab1.tabDelRow(tab1.tabBiggestRow());
- tab1.tabDisplay();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement