算法学习笔记----判断集合S中是否存在有两个其和等于x的元素(三)
- a[i])) {
return 0;
}
}
return -1;
}
int main(void)
{
int source[] = { 7, 5, 2, 4, 6, 1, 5, 3};
int x = 13; www.2cto.com
int ret;
ret = check_exist_x(source, ARRAY_SIZE(source), x);
printf("If there are two elements whose sum equals to x %s.\n",
ret < 0 "No" : "Yes");
return 0;
}