无符号数的运算问题
近日, 用到了无符号数的一个表达式.unsigned int a = 2;
unsigned long t = 0;
int j = 0;
int i = 0;
t = 2* A[i] + t - 2*t;
A[i] = (unsigned int)t;
发现2*A[i] + t-2t 会溢出无符号数的范围. 不知怎么解决
o, A[i] is unsigned int type.
unsigned int A[128] = {0};