博客
关于我
java语言——如何判断整数溢出
阅读量:339 次
发布时间:2019-03-04

本文共 1477 字,大约阅读时间需要 4 分钟。

????????????????????????????????????????????????

??

public static int addExact(int x, int y) {    int r = x + y;    // ???????    boolean overflow = ( (x ^ r) > 0 ) != ( (y ^ r) > 0 );    if (overflow) {        throw new ArithmeticException("integer overflow");    }    return r;}

??

public static int subtractExact(int x, int y) {    int r = x - y;    // ???????    boolean overflow = ( (x ^ r) > 0 ) != ( (y ^ r) > 0 );    if (overflow) {        throw new ArithmeticException("integer overflow");    }    return r;}

??

public static int multiplyExact(int x, int y) {    long r = (long)x * (long)y;    if ( (int)r != r ) {        throw new ArithmeticException("integer overflow");    }    return (int)r;}

?????

public static long multiplyExact(long x, long y) {    long r = x * y;    // ???????    if ( (x == 0 || y == 0) ) {        return r;    }    // ???????    long ax = Math.abs(x);    long ay = Math.abs(y);    if ( (ax > Integer.MAX_VALUE / ay) || (ay > Integer.MAX_VALUE / ax) ) {        // ????        long temp = r / y;        if ( (y != 0) && (temp != x) ) {            throw new ArithmeticException("long overflow");        }        // ??????        if (x == Long.MIN_VALUE && y == -1) {            throw new ArithmeticException("long overflow");        }    }    return r;}

??

  • ?????????x?y???r?????????????????????????????

  • ???????????????????????

  • ??????????????????????????????

  • ?????????????????????????Long.MIN_VALUE?-1????

??????????????????????????????????????

转载地址:http://trch.baihongyu.com/

你可能感兴趣的文章
Qt笔记——布局管理三件套分割窗口、停靠窗口和堆栈窗口
查看>>
poj 3277 线段树
查看>>
POJ 3349 Snowflake Snow Snowflakes
查看>>
POJ 3411 DFS
查看>>
poj 3422 Kaka's Matrix Travels (费用流 + 拆点)
查看>>
Qt笔记——官方文档全局定义(二)Functions函数
查看>>
POJ 3468 A Simple Problem with Integers
查看>>
poj 3468 A Simple Problem with Integers 降维线段树
查看>>
poj 3468 A Simple Problem with Integers(线段树 插线问线)
查看>>
poj 3485 区间选点
查看>>
poj 3518 Prime Gap
查看>>
poj 3539 Elevator——同余类bfs
查看>>
Qt笔记——官方文档全局定义(三)Macros宏
查看>>
poj 3628 Bookshelf 2
查看>>
Qt笔记——官方文档全局定义(一)Types数据类型
查看>>
POJ 3670 DP LIS?
查看>>
POJ 3683 Priest John's Busiest Day (算竞进阶习题)
查看>>
POJ 3988 Selecting courses
查看>>
POJ 4020 NEERC John's inversion 贪心+归并求逆序对
查看>>
poj 4044 Score Sequence(暴力)
查看>>