二进制的子苏

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

problem Maximum Subarray Easy Given 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,...