配列
1次元配列
import java.io.*;
class sample07{
public static void main
(String[] args
){ // 初期値
int list[] = {10, 20, 30};
for(int i = 0;i < list.length;i++){
System.
out.
printf("list[%d]=%d\n", i, list
[i
]); }
// 動的定義
try{
int[] data;
data = new int[b];
for(int i = 0;i < data.length;i++){
data[i] = i + 10;
System.
out.
printf("data[%d]=%d\n", i, data
[i
]); }
ex.printStackTrace();
}
}
}
多次元配列
import java.io.*;
class sample08{
public static void main
(String[] args
){
// 初期設定
int[][] list = { { 10, 11, 12} ,
{ 20, 21, 22} ,
{ 30, 31, 32} };
for(int i = 0;i < list.length;i++){
for(int j = 0;j < list[i].length;j++){
System.
out.
printf("list[%d][%d]=%d ", i, j, list
[i
][j
]); }
}
// 可変設定
int[][] data;
try{
System.
out.
print("data[i][j]のi="); System.
out.
print("data[i][j]のj=");
// 再定義
data = new int[b1][b2];
for(int i = 0;i < data.length;i++){
for(int j = 0;j < data[i].length;j++){
data[i][j] = 10 + ((i+1) * (j+1));
System.
out.
printf("data[%d][%d]=%d ", i, j, data
[i
][j
]); }
}
ex.printStackTrace();
}
}
}
ジャグ配列(可変配列)
import java.io.*;
class sample09{
public static void main
(String[] args
){
// 初期設定
int[][] list = { { 10, 20, 30} ,
{ 90} ,
{ 41, 42, 43, 44}};
for(int i = 0;i < list.length;i++){
for(int j = 0;j < list[i].length;j++){
System.
out.
printf("list[%d][%d]=%d ", i, j, list
[i
][j
]); }
}
// 可変設定
int[][] data;
try{
System.
out.
print("data[i][]のi=");
data = new int[b][];
for(int i = 0;i < data.length;i++){
System.
out.
printf("data[%d][j]のj=", i
); data[i] = new int[b2];
for(int j = 0;j < data[i].length;j++){
data[i][j] = ((i+1) * (j+1)) * 10;
}
}
for(int i = 0;i < data.length;i++){
for(int j = 0;j < data[i].length;j++){
System.
out.
printf("data[%d][%d]=%d ", i, j, data
[i
][j
]); }
}
ex.printStackTrace();
}
}
}
最終更新:2012年09月02日 10:17