背景

传说里玉皇大帝派龙王马上降雨到共光一带，龙王接到玉皇大帝命令，立马从海上调水，跑去共光施云布雨，但粗心又着急的龙王不小心把海里的鲸鱼随着雨水一起降落在了共光，龙王怕玉皇大帝责怪，灵机一动便声称他是派鱼到共光，希望百姓可以年年有余，并请求玉皇大帝将这条鱼任命为鱼神，保佑人间太平可以年年有余。

年年有余

java 求余操作初阶

java中也有求余的规范【jls-15.17.3】，废话不说，直接上代码，从中我们可以学到很多技巧：

例1：

        int a = 5%3; // 2
        int b = 5/3; // 1
        System.out.println("5%3 produces " + a +" (note that 5/3 produces " + b + ")");

相信大多数人都知道结果了：

5%3 produces 2 (note that 5/3 produces 1)

java 求余操作中阶

我们知道，正数不仅仅有正整数还有负整数，那么负数的情况下，会出现什么变化呢？

例2：

int c = 5%(-3); // 2
int d = 5/(-3); // -1
System.out.println("5%(-3) produces " + c +" (note that 5/(-3) produces " + d + ")");
int e = (-5)%3; // -2
int f = (-5)/3; // -1
System.out.println("(-5)%3 produces " + e +" (note that (-5)/3 produces " + f + ")");
int g = (-5)%(-3); // -2
int h = (-5)/(-3); // 1
System.out.println("(-5)%(-3) produces " + g +" (note that (-5)/(-3) produces " + h + ")");

能完全正确得到结果的就很少了吧？

5%(-3) produces 2 (note that 5/(-3) produces -1)
(-5)%3 produces -2 (note that (-5)/3 produces -1)
(-5)%(-3) produces -2 (note that (-5)/(-3) produces 1)

为什么求余的结果是这样的呢？jls-15.17.3规范告诉我们：

The binary % operator is said to yield the remainder of its operands from an implied division; the left-hand operand is the dividend and the right-hand operand is the divisor.
It follows from this rule that the result of the remainder operation can be negative only if the dividend is negative, and can be positive only if the dividend is positive. Moreover, the magnitude of the result is always less than the magnitude of the divisor.

注意：求余的正负数给dividend(左边操作数)的符号位一致！

java 求余操作高阶

java求余操作不但支持整数还支持浮点数

class Test2 {
 public static void main(String[] args) {
 double a = 5.0%3.0; // 2.0
 System.out.println("5.0%3.0 produces " + a);
 double b = 5.0%(-3.0); // 2.0
 System.out.println("5.0%(-3.0) produces " + b);
 double c = (-5.0)%3.0; // -2.0
 System.out.println("(-5.0)%3.0 produces " + c);
 double d = (-5.0)%(-3.0); // -2.0
 System.out.println("(-5.0)%(-3.0) produces " + d);
 }
}

相信很多人可以根据整型的规则，得出正确的结果

5.0%3.0 produces 2.0
5.0%(-3.0) produces 2.0
(-5.0)%3.0 produces -2.0
(-5.0)%(-3.0) produces -2.0

补充一下，浮点型的求余有一些特殊的规则

The result of a floating-point remainder operation as computed by the % operator is not the same as that produced by the remainder operation defined by IEEE 754. The IEEE 754 remainder operation computes the remainder from a rounding division, not a truncating division, and so its behavior is not analogous to that of the usual integer remainder operator. Instead, the Java programming language defines % on floating-point operations to behave in a manner analogous to that of the integer remainder operator; this may be compared with the C library function fmod. The IEEE 754 remainder operation may be computed by the library routine Math.IEEEremainder.

The result of a floating-point remainder operation is determined by the rules of IEEE 754 arithmetic:

• If either operand is NaN, the result is NaN.
• If the result is not NaN, the sign of the result equals the sign of the dividend.
• If the dividend is an infinity, or the divisor is a zero, or both, the result is NaN.
• If the dividend is finite and the divisor is an infinity, the result equals the dividend.
• If the dividend is a zero and the divisor is finite, the result equals the dividend.
• In the remaining cases, where neither an infinity, nor a zero, nor NaN is involved, the floating-point remainder r from the division of a dividend n by a divisor d is defined by the mathematical relation r = n - (d ⋅ q) where q is an integer that is negative only if n/d is negative and positive only if n/d is positive, and whose magnitude is as large as possible without exceeding the magnitude of the true mathematical quotient of n and d.

  java 求余操作骨灰级

学到这里，或许有人沾沾自喜，我都掌握了求余的所有规则，看来需要给你泼泼冷水：

    public static void main(String[] args) {
        final int MODULUS = 3;
        int[] histogram = new int[MODULUS];
    // Iterate over all ints (Idiom from Puzzle 26)
        int i = Integer.MIN_VALUE;
        do {
        histogram[Math.abs(i) % MODULUS]++;
        } while (i++ != Integer.MAX_VALUE);
        for (int j = 0; j < MODULUS; j++)
        System.out.println(histogram[j] + " ");
    }

这个程序会打印什么？有人经过繁琐复杂的算出一个结果：

1431655765 1431655766 1431655765

但其实，上述程序运行报错：

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: -2
    at com.java.puzzlers.ModTest.main(ModTest.java:11)

为什么数组会出现索引 -2？奇怪吧？要回答这个问题，我们必须要去看看Math.abs 的文档

 /**
 * Returns the absolute value of an {@code int} value.
 * If the argument is not negative, the argument is returned.
 * If the argument is negative, the negation of the argument is returned.
 *
 * <p>Note that if the argument is equal to the value of
 * {@link Integer#MIN_VALUE}, the most negative representable
 * {@code int} value, the result is that same value, which is
 * negative.
 *
 * @param a the argument whose absolute value is to be determined
 * @return the absolute value of the argument.
 */
 public static int abs(int a) {
 return (a < 0) ? -a : a;
 }

特意说明，如果是Integer#MIN_VALUE，返回负数
java里有很多小技巧，需要我们勤翻api和jsl，多学习多练习。

参考资料：

【1】https://baike.baidu.com/item/%E5%B9%B4%E5%B9%B4%E6%9C%89%E4%BD%99/7625174?fr=aladdin

【2】https://docs.oracle.com/javase/specs/jls/se12/html/jls-15.html#jls-15.17.3

【3】java解惑