在處理HashSet時,我得到了concurrentModificatoin異常,因此轉移到了ConcurrentSkipListSet。雖然併發問題已解決,但我現在有一個新問題。看起來ConcurrentSkipListSet默認是靜態的。是這樣嗎?我在一個遞歸函數中使用它,它有一個迭代器遍歷它。當迭代下一個元素時,由於同一個函數的另一個重複實例所做的更改會反映到同一個對象中(通常情況下,在正常遞歸中不會出現這種情況,其中每個實例都在堆棧中分配了自己的空間)。我不希望更改反映出來。有沒有解決這個問題的方法?ConcurrentSkipListSet是靜態的嗎?
感謝提前:)
我使用Java和這裏的代碼...
public class TSA {
int[][] l = { { 0, 1, 30, 65535 }, { 50, 0, 15, 5 }, { 65535, 65535, 0, 15 }, { 15, 65535, 5, 0 } };
int[][] g;
TSA() {
int n = 4;
this.g = this.l;
int k = 0;
ConcurrentSkipListSet a = new ConcurrentSkipListSet();
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
this.g[i][j] = this.l[i][j];
}
}
System.out.println(this.g[2][1]);
a.add(2);
a.add(3);
a.add(4);
Iterator ir = a.iterator();
int[] path = new int[n];
k = 0;
while (ir.hasNext()) {
ConcurrentSkipListSet b = new ConcurrentSkipListSet();
b = a;
b.add(2);
b.add(3);
b.add(4);
int next = (Integer) ir.next();
System.out.println("next in main is " + next);
System.out.println("called with " + b);
path[k++] = this.l[0][next - 1] + gfun(next, b);
System.out.println("min path is..." + path[k - 1]);
}
}
public static void main(final String[] args) {
new TSA();
}
int gfun(final int next, final ConcurrentSkipListSet d) {
ConcurrentSkipListSet b = d;
if (b.size() != 1 && b.size() != 2) {
b.remove(next);
System.out.println(b);
int[] path = new int[b.size()];
int k = 0;
Iterator ir = b.iterator();
while (ir.hasNext()) {
int a = (Integer) ir.next();
System.out.println(a + " iterator prob " + b);
path[k] = this.l[next - 1][a - 1] + gfun(a, b);
System.out.println("path[" + k + "] is" + path[k]);
k = k + 1;
}
return min(path);
}
else if (b.size() == 2) {
System.out.println("second instance..." + next + ".." + b);
Iterator irrr = b.iterator();
int a = (Integer) irrr.next();
b.remove(next);
return (gfun(next, b));
}
else {
Iterator irr = b.iterator();
int j = (Integer) irr.next();
System.out.println("inside prog size is 1" + b);
System.out.println("l[" + next + "][" + j + "] is " + this.l[next - 1][j - 1]);
int ans = this.l[next - 1][j - 1] + this.g[j - 1][0];
System.out.println("l[" + next + "][" + j + "]+g[" + j + "][1] which is " + ans + " is r returned");
return (ans);
}
}
private int min(final int[] path) {
int m = path[0];
for (int i = 0; i < path.length; i++) {
if (path[i] < m) {
m = path[i];
}
}
return m;
}
}
我除去集合B的元素,當函數返回到以前的狀態(while循環內的迭代器)原始集合b會受到影響。我不希望發生這種情況。有人請幫忙! :(
如果你要顯示你的代碼,它將會非常有用。您對「正常遞歸」的描述雖然對我來說聽起來並不完全正確...... –
也許對您知道您使用的是什麼語言也有幫助... – Krease
我正在使用java,這裏是代碼... –