求二维数组的算法
现有一表，结构如下
field_01 field_02 field_03
1 A B
1 E W
1 P F
2 D E
2 W V
动态生成,如下结构，应如何算？
..............
ProvCount[0][0] = new Option("A","B");
ProvCount[0][1] = new Option("E","W");
ProvCount[0][2] = new Option("P","F");
ProvCount[1][0] = new Option("D","E");
ProvCount[1][1] = new Option("W","V");
.................
问题点数：20、回复次数：3Top
1 楼nameone（过客）回复于 2006-03-10 10:57:32 得分 0
UPTop
2 楼lsgis2001（程序爱好者）回复于 2006-03-10 10:59:19 得分 15
while not rs.eof
for i=0 to 2
for j=0 to 2
ProvCount[i][j]= new Option(rs("f_02"),rs("f_03"))
rs.movenext
if rs.eof then exit for
next
if rs.eof then exit for
next
loopTop
3 楼c_delight（向前冲）回复于 2006-03-10 11:06:41 得分 5
楼主是要动态的吧
for i=0 to m
for j=0 to n
？？
用HashTable？
Top
