二进制的子苏

How原码反码补码正数符号位＋0本身本身负数符号位+1符号位不变，其余取反补码+1[+1] = [00000001]原 = [00000001]反 = [00000001]补[-1] = [10000001]原 = [11111110]反 = [11111111]补why为什么用原码解决计算机不认识减法的问题，1-1变成1+（-1）...

problemMaximum SubarrayEasyGiven an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.Example:Input: [-2,1,-3,4,-1,2,...