
algorithm
cqgvip
站在巨人肩上也不是最高的
展开
-
快速幂运算
程序public class QuickPowerAlgorithm { public static void main(String[] args) { long base=2; long power=10; long result = powerCalc(2, 10); System.out.printf("%d^%d=%d",base,power,result); } public static long原创 2021-01-07 23:14:52 · 90 阅读 · 0 评论 -
判断一个数的正负
程序public class Zf0Algorithm { public static void main(String[] args) { System.out.println(zf0(13)); System.out.println(zf0(0)); System.out.println(zf0(-25)); } public static int zf0(int num) { return (num>&原创 2021-01-07 02:27:35 · 673 阅读 · 1 评论 -
水仙花
水仙花算法程序public class SxhAlgorithm { public static void main(String[] args) { int[] dics = new int[10]; for (int i = 0; i < 10; i++) { dics[i]=i*i*i; } for (int i = 100; i <= 999 ; i++) { in原创 2021-01-07 01:49:56 · 111 阅读 · 0 评论 -
判断一个数是2的幂次方
程序public class Power2Algorithm { public static void main(String[] args) { System.out.println(isPower2(4)); System.out.println(isPower2(6)); } public static boolean isPower2(int num) { return (num&(num-1))==0;原创 2021-01-07 02:12:58 · 231 阅读 · 0 评论