位运算和取模运算的效率

一、测试代码：

package BitAndModulus;

public class BitAndModulusTest {
    
    public static void main(String[] args) {
        int number=1;
        for (int i = 0; i <3 ; i++) {
            System.out.println("第----------"+(i+1)+"次比较：--------------");
            number*=1000;
            System.out.println("number："+number);
            BitAndModulusTest.bit(number);
            BitAndModulusTest.modulus(number);
        }

    }

    public static void bit(int number) {
        int a = 1;
        long start = System.currentTimeMillis();
        for (int i = number; i > 0; i++) {
            a &= i;
        }
        long end = System.currentTimeMillis();
        System.out.println("位运算耗时： " + (end - start));
    }

    public static void modulus(int number) {
        int a = 1;
        long start = System.currentTimeMillis()