-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathEvenMoreArray.java
More file actions
145 lines (136 loc) · 4.36 KB
/
Copy pathEvenMoreArray.java
File metadata and controls
145 lines (136 loc) · 4.36 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
package com.example.Array;
public class EvenMoreArray {
public void together(char n[][]){
String res = "";
for (int i = 0; i <= n.length-1; i++){
for (int j = 0; j <= n[i].length-1; j++){
res += n[i][j];
}
}
System.out.println(res);
}
public void matrix(int n){
int max[][] = new int [n][n];
int num = 0;
for (int i = 0; i <= max.length - 1; i++){
max[i][num] = n;
num++;
}
num = n - 1;
for (int i = 0; i <= max.length - 1; i++){
max[i][num] = n;
num--;
}
for (int i = 0; i <= max.length-1; i++){
for (int j = 0; j <= max[i].length-1; j++){
System.out.print(max[i][j] + " ");
}
System.out.println();
}
}
public void triangle(int n){
int num[][] = new int[n][];
int a = 1;
for (int i = 0; i <= num.length-1; i++){
num[i] = new int [i+1];
}
for (int i = 0; i <= num.length-1; i++){
for (int j = 0; j <= num[i].length-1; j++){
num[i][j] = a;
a++;
}
}
for (int i = 0; i <= num.length-1; i++){
for (int j = 0; j <= num[i].length-1; j++) {
System.out.print(num[i][j] + " ");
}
System.out.println();
}
}
public void zero(int n[][]){
int num[][] = new int[n.length][];
int a = 0;
for (int i = 0; i <= n.length-1; i++){
num[i] = new int[n[i].length*2];
}
for (int i = 0; i <= n.length-1; i++){
a = 0;
for (int j = 0; j+2 <= num[i].length; j+=2){
num[i][j] = n[i][j-a];
num[i][j+1] = 0;
a++;
}
}
for (int i = 0; i <= num.length-1; i++){
for (int j = 0; j <= num[i].length-1; j++) {
System.out.print(num[i][j] + " ");
}
System.out.println();
}
}
public void reverse(double n[][]){
double temp;
for (int i = 0; i <= n.length-1; i++){
for (int j = 0; j <= (n[i].length - 1) / 2; j++){
temp = n[i][j];
n[i][j] = n[i][n[i].length-j-1];
n[i][n[i].length-j-1] = temp;
}
}
for (int i = 0; i <= n.length-1; i++){
for (int j = 0; j <= n[i].length-1; j++) {
System.out.print(n[i][j] + " ");
}
System.out.println();
}
}
public void sumOfColumn(double n[][]){
int a[] = new int[n[0].length];
int pos = 0;
for (int j = 0; j <= n[0].length - 1; j++) {
for (int i = 0; i <= n.length - 1; i++) {
a[pos] += n[i][j];
}
pos++;
}
for (int i = 0; i <= a.length-1; i++){
System.out.print(a[i] + " ");
}
System.out.println();
}
public void sortArray(int n[][]){
int temp = 0;
for (int i = 0; i <= n.length - 1; i++){
for (int j = 0; j <= n[i].length-2; j++){
for (int k = j + 1; k <= n[i].length-1; k++){
if (n[i][j] > n[i][k]){
temp = n[i][k];
n[i][k] = n[i][j];
n[i][j] = temp;
}
}
}
}
for (int i = 0; i <= n.length - 1; i++) {
for (int j = 0; j <= n[i].length - 1; j++) {
System.out.print(n[i][j] + " ");
}
System.out.println();
}
}
public static void main(String[]args){
EvenMoreArray runner = new EvenMoreArray();
char a[][] = {{'h', 'e', 'l'}, {'l', 'o'}};
int b[][] = {{1, 2, 3}, {4, 5}};
double c[][] = {{1, 2, 3, 4}, {4, 5}};
double d[][] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};
int e[][] = {{1, 3, 9, 7}, {6, 4, 3, 1}, {7, 2, 5, 6}, {5, 2, 3, 1}};
runner.together(a);
runner.matrix(5);
runner.triangle(5);
runner.zero(b);
runner.reverse(c);
runner.sumOfColumn(d);
runner.sortArray(e);
}
}