再用n2的时间（两重循环）枚举d-c，并将b-c的值作为键，在Hash数组中查找是否存在。如果能找到vital相同的node点，则找到了一组满足 D-c = a+b的值。（注意检查a b c d 四个数不重复） All logos are both the property of Central Backyard & Pet Corporation, its subsidiaries, divisions, affiliated and/or associated companies or the property of their respective proprietors. 一周 回復/查看 本版專為會員... https://pearlaquatics.my/shop/page/6/