Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
executable file
·
47 lines (35 loc) · 832 Bytes

File metadata and controls

executable file
·
47 lines (35 loc) · 832 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package array;
import java.util.Arrays;
public class ReverseArray {
static int[] data = { 1, 2 };
public static void main(String[] args) {
ReverseArray re = new ReverseArray();
//re.reverse(data);
re.init();
}
void init(){
int[][] a = new int[][]{{1},{1,2},{1,3,3,1}};
System.out.println("a.length is "+a.length);
for(int i=0;i<a.length;i++){
System.out.println(Arrays.toString(a[i]));
System.out.println(a[i].length);
}
}
void reverse(int[] a) {
for (int i = 0; i < a.length / 2; i++) {
exchange(i);
}
// System.out.println(Arrays.toString(a));
}
void exchange(int index) {
int tem = data[index];
data[index] = data[data.length - 1 - index];
data[data.length - 1 - index] = tem;
}
void digui1(int n) {
if (n < 500)
digui1(n * 2);
else
System.out.println(n);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.