Java关于奇数偶数的 为什么有人说偶数乘偶数是奇数呢
\u5947\u6570\u548c\u5076\u6570\u5206\u522b\u662f\uff1f\u6d3b\u52a8\u8bfe\u4e0a\uff0c\u9ed1\u718a\u8001\u5e08\u7b11\u7740\u5bf9\u5927\u5bb6\u8bf4\uff1a\u201c\u6211\u4eec\u6765\u505a\u4e2a\u6e38\u620f\uff0c\u597d\u4e0d\u597d\uff1f\u201d
\u201c\u597d\uff01\u201d\u5c0f\u52a8\u7269\u4eec\u9f50\u58f0\u56de\u7b54\u3002
\u201c\u8bf7\u4f60\u4eec\u6bcf\u4f4d\u51c6\u5907\u4e24\u5f20\u5c0f\u7eb8\u6761\u3002\u201d\u9ed1\u718a\u8001\u5e08\u6e05\u4e86\u6e05\u55d3\u5b50\u8bf4\u3002
\u5c0f\u52a8\u7269\u4eec\u4e0d\u77e5\u9053\u9ed1\u718a\u8001\u5e08\u8981\u5b83\u4eec\u505a\u4ec0\u4e48\u6e38\u620f\uff0c\u4e00\u4e2a\u4e2a\u5174\u594b\u5f97\u773c\u775b\u53d1\u4eae\uff0c\u5f88\u5feb\u90fd\u628a\u5c0f\u7eb8\u6761\u51c6\u5907\u597d\u4e86\u3002
\u9ed1\u718a\u8001\u5e08\u73af\u89c6\u4e00\u4e0b\u5168\u73ed\u540c\u5b66\uff0c\u8bf4\uff1a\u201c\u8bf7\u4f60\u4eec\u5728\u4e24\u5f20\u5c0f\u7eb8\u6761\u4e0a\u5206\u522b\u5199\u4e00\u4e2a\u5947\u6570\u548c\u4e00\u4e2a\u5076\u6570\uff0c\u5199\u597d\u540e\uff0c\u4e24\u624b\u5404\u63e1\u4e00\u5f20\u3002\u4e0d\u8981\u7ed9\u6211\u4e5f\u4e0d\u8981\u7ed9\u4f60\u8eab\u8fb9\u7684\u540c\u5b66\u770b\u89c1\u3002\u201d
\u5c0f\u52a8\u7269\u4eec\u4e0d\u4e45\u524d\u521a\u5b66\u8fc7\u5173\u4e8e\u5947\u6570\u548c\u5076\u6570\u7684\u77e5\u8bc6\uff0c\u4e0d\u4e00\u4f1a\u513f\uff0c\u5927\u5bb6\u90fd\u5b8c\u6210\u4e86\u9ed1\u718a\u8001\u5e08\u63d0\u51fa\u7684\u8981\u6c42\u3002
\u201c\u542c\u7740\uff0c\u201d\u9ed1\u718a\u8001\u5e08\u4e00\u5b57\u4e00\u53e5\u6e05\u6670\u5730\u8bf4\u9053\uff0c\u201c\u4f60\u4eec\u5404\u4f4d\u90fd\u8bf7\u5c06\u53f3\u624b\u4e2d\u7684\u6570\u4e582\uff0c\u5de6\u624b\u4e2d\u7684\u6570\u4e583\uff0c\u518d\u628a\u4e58\u79ef\u76f8\u52a0\u3002\u4e0d\u8981\u7b97\u51fa\u58f0\u97f3\u6765\u3002\u201d
\u7b49\u5c0f\u52a8\u7269\u4eec\u4e00\u4e2a\u4e2a\u90fd\u7b97\u597d\u4e86\uff0c\u9ed1\u718a\u8001\u5e08\u53c8\u53eb\u7b97\u51fa\u5f97\u6570\u662f\u5947\u6570\u7684\u5c0f\u52a8\u7269\u4eec\u6392\u6210\u4e00\u961f\uff1b\u5f97\u6570\u662f\u5076\u6570\u7684\u6392\u4e00\u961f\u3002
\u5c0f\u52a8\u7269\u4eec\u90fd\u7ad9\u597d\u4e86\uff0c\u4e00\u4e2a\u4e2a\u611f\u5174\u8da3\u5730\u770b\u7740\u9ed1\u718a\u8001\u5e08\uff0c\u731c\u6d4b\u7740\u5b83\u4e0b\u4e00\u6b65\u8981\u5b83\u4eec\u505a\u4ec0\u4e48\u3002
\u201c\u597d\u4e86\uff01\u201d\u9ed1\u718a\u8001\u5e08\u6307\u7740\u5f97\u6570\u662f\u5947\u6570\u7684\u90a3\u6392\u5c0f\u52a8\u7269\u8bf4\uff0c\u201c\u4f60\u4eec\u5de6\u624b\u63e1\u7684\u90fd\u662f\u5947\u6570\u3002\u201d
\u5b83\u53c8\u6307\u7740\u53e6\u4e00\u6392\u5c0f\u52a8\u7269\u8bf4\uff1a\u201c\u4f60\u4eec\u5de6\u624b\u63e1\u7684\u90fd\u662f\u5076\u6570\u3002\u201d
\u4e24\u6392\u5c0f\u52a8\u7269\u644a\u5f00\u624b\u638c\u4e00\u770b\uff0c\u53ef\u4e0d\u662f\uff0c\u9ed1\u718a\u8001\u5e08\u731c\u5f97\u5b8c\u5168\u6b63\u786e\u3002
\u5c0f\u52a8\u7269\u4eec\u60ca\u5947\u6781\u4e86\uff0c\u5fcd\u4e0d\u4f4f\u7eb7\u7eb7\u95ee\u9053\uff1a\u201c\u8001\u5e08\uff0c\u60a8\u662f\u600e\u4e48\u77e5\u9053\u7684\uff1f\u201d
\uff3b\u7b54\u6848\uff1a\u5947\u6570\u00d72\uff1d\u5076\u6570\u5947\u6570\u00d73\uff1d\u5947\u6570
\u5076\u6570\u00d72\uff1d\u5076\u6570\u5076\u6570\u00d73\uff1d\u5076\u6570
\u800c\u5076\u6570\u5341\u5076\u6570\uff1d\u5076\u6570\u5076\u6570\u5341\u5947\u6570\uff1d\u5947\u6570
\u5de6\u624b\u662f\u5947\u6570\u65f6\uff0c\u5947\u6570\u00d73\u662f\u5947\u6570\uff0c\u5947\u6570\u5341\u5076\u6570\uff08\u53f3\u624b\u4e2d\u7684\u5076\u6570\u00d72\uff09\uff0c\u7ed3\u679c\u662f\u5947\u6570\u3002
\u800c\u5982\u53f3\u624b\u662f\u5947\u6570\u65f6\uff0c\u5947\u6570\u00d72\u6210\u5076\u6570\uff0c\u5076\u6570\u5341\u5076\u6570\uff08\u5de6\u624b\u4e2d\u7684\u5076\u6570\u00d73\uff09\uff0c\u7ed3\u679c\u662f\u5076\u6570\u3002
\u8fd9\u5c31\u662f\u6700\u540e\u7ed3\u679c\u4e0e\u5de6\u624b\u4e2d\u6570\u5b57\u5947\u5076\u76f8\u540c\u7684\u539f\u56e0\uff0c\u4e5f\u5373\u6211\u8fd9\u4e2a\u731c\u6cd5\u7684\u6839\u636e\u3002
\u5c0f\u52a8\u7269\u4eec\u604d\u7136\u5927\u609f\u2026\u2026\uff3d
\u4ed6\u4eec\u8bf4\u9519\u4e86\u5427\uff0c\u5076\u6570\u4e58\u5076\u6570\u8fd8\u662f\u7b49\u4e8e\u5076\u6570\uff0c\u5947\u6570\u4e58\u4ee5\u5076\u6570\u4e5f\u662f\u5076\u6570\uff0c\u53ea\u6709\u5947\u6570\u4e58\u4ee5\u5947\u6570\u624d\u662f\u5947\u6570\uff0c\u4f60\u53ef\u4ee5\u81ea\u5df1\u627e\u51e0\u4e2a\u6570\u5b57\u8bd5\u4e00\u4e0b\uff0c\u5076\u6570\u4e58\u4ee5\u5076\u6570\u4e0d\u53ef\u80fd\u51fa\u6765\u5947\u6570\u7684
看代码：
import java.util.Arrays;
public class Demo {
public static void main(String[] args) throws Exception {
int[] arr = {8, 2, 6, 5, 100, 9, 3, 23, 90, 31};
System.out.println("数组为：" + Arrays.toString(arr));
int max = Integer.MIN_VALUE;
int minOddNum = Integer.MAX_VALUE;
int evenNumCount = 0;
for (int i = 0, len = arr.length; i < len; ++i) { // 遍历数组
// 如果 max 比当前元素小，那么让 max 等于当前元素
if (max < arr[i]) {
max = arr[i];
}
// 如果当前元素为奇数并且 minOddNum 大于当前元素
if (isOddNum(arr[i]) && minOddNum > arr[i]) {
minOddNum = arr[i];
}
// 如果不是奇数（即如果是偶数）
if (!isOddNum(arr[i])) {
++evenNumCount;
}
}
System.out.printf("最大值：%d
最小值奇数：%d
偶数的个数：%d
",
max, minOddNum, evenNumCount);
}
// 判断一个数是否为奇数
private static boolean isOddNum(int num) {
return (num & 1) == 1;
}
}
运行：
public class ArrayDemo {
public static void main(String[] args) {
int[] arr = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
int max = getMax(arr);
int min = getMin(arr);
int ou = getOu(arr);
int ji = getJi(arr);
System.out.println("最大值："+max+"最小值："+min+"偶数个数："+ou+"奇数个数："+ji);
}
//求奇数个数
private static int getJi(int[] arr) {
int count = 0;
for (int x = 0; x < arr.length; x++) {
if(arr[x]%2!=0){
count++;
}
}
return count++;
}
//求偶数个数
private static int getOu(int[] arr) {
int count = 0;
for (int x = 0; x < arr.length; x++) {
if(arr[x]%2==0){
count++;
}
}
return count++;
}
private static int getMin(int[] arr) {
// TODO Auto-generated method stub
int min = arr[0];
for (int x = 1; x < arr.length; x++) {
if (arr[x] < min) {
min = arr[x];
}
}
return min;
}
// 求最大值
private static int getMax(int[] arr) {
int max = arr[0];
for (int x = 1; x < arr.length; x++) {
if (arr[x] > max) {
max = arr[x];
}
}
return max;
}
}
绛旓細import java.util.Arrays;public class Demo {public static void main(String[] args) throws Exception {int[] arr = {8, 2, 6, 5, 100, 9, 3, 23, 90, 31};System.out.println("鏁扮粍涓猴細" + Arrays.toString(arr));int max = Integer.MIN_VALUE;int minOddNum = Integer.MAX_VA...
绛旓細public static void main(String[] args) { int i=10;//姹侼涓,杩欓噷鍋囪涓10 int h=1;int xx=0;//鍋舵暟鐨鍜 int yy=0;//濂囨暟鐨勫拰 while(i>1){ if(h%2==0){ //鍋舵暟鐨勫拰 xx+=h;i--;} else { // 濂囨暟鐨勫拰 yy+=h;i--;} h++;} System.out.println(i+"涓伓鏁扮殑鍜:"...
绛旓細鍦ㄥ垽鏂嚱鏁颁腑锛屽皢杈撳叆鏁板煎拰2杩涜鍙栦綑锛屼綑鏁颁负0鐨勬槸鍋舵暟锛屽惁鍒欐槸濂囨暟锛涘湪涓诲嚱鏁颁腑閫氳繃scanf鍏堣鐢ㄦ埛杈撳叆涓涓暟锛岀劧鍚庤皟鐢ㄥ垽鏂嚱鏁帮紝鍒ゆ柇杈撳叆鏁板煎鍋讹紝杈撳嚭鍒ゆ柇淇℃伅銆俰nclude<stdio.h> int IsJiShu(int a){ if(a%2==1) return 1;else if(a%2==0)return 0; } int main(){ int n;while...
绛旓細public static void main(String args[]){ int a,b;Scanner sc=new Scanner(System.in); //灞閮ㄥ彉閲廱閲嶅 a=sc.nextInt(); //灞閮ㄥ彉閲廰閲嶅 if(a%2==0 ) //鍒ゆ柇鏉′欢閿欒 { System.out.println("杩欎釜鏁版槸鍋舵暟");} else System.out.println("杩欎釜鏁版槸濂囨暟");} } ...
绛旓細// dividend琚櫎鏁 divisor 闄ゆ暟public static int remainder(int dividend, int divisor){ return dividend - dividend / divisor * divisor;} 鎵浠ュ綋杈撳叆 -1鏃 杩愮畻缁撴灉鏄-1锛屽綋鐒朵笉绛変簬1浜嗭紝鎵浠ュ畠琚垽瀹氫负鍋舵暟浜嗐傚洜涓烘敼涓哄垽鏂槸鍚︽槸鍋舵暟鍗冲彲 i % 2 == 0 ? "鍋舵暟" : "濂囨暟";Java鏄竴...
绛旓細杈撳叆鏁存暟n锛屾眰1鈥攏涓墍鏈夎兘澶熻2鎴栬呰3鏁撮櫎鐨勬暟涔嬪拰锛岃繖鏍风殑Java绋嬪簭鍙互鐢╢or鍑芥暟鏉ュ疄鐜般傚叿浣撶▼搴忓涓嬶細Scanner sc = new Scanner(System.in);int n = sc.nextInt();int temp = 0;for (int i = 1; i <= n; i++) { if (i % 2 == 0 || i % 3 == 0){ temp += i;}...
绛旓細public static void reorder(int[] nums) { int left = 0;int right = nums.length - 1;while (left < right) { // 浠庡乏寰鍙虫壘鍒颁竴涓鍋舵暟 while (left < right && nums[left] % 2 != 0) { left++;} // 浠庡彸寰宸︽壘鍒颁竴涓濂囨暟 while (left < right && nums[right] % 2 == ...
绛旓細b = false;} if (b) { System.out.println("鏄濂囨暟");} else { System.out.println("鏄鍋舵暟");} } public static void main(String args[]) { Num num = new Num(); num.number(88); //鐪嬩綘鎯冲湪鍝噷鍒ゆ柇涓涓暟灏辫皟鐢ㄥ畠 } }浣犺嚜宸辫繍琛岀湅鐪 ...
绛旓細int oushuSUM = 0; //鍒濆鍋舵暟鍜 for (int i = 1; i < 1000; i++) { int yushu = i%2; //鍙栦綑鏁 if(yushu == 0){ //鑳借0鏁撮櫎鐨勬槸鍋舵暟 oushuSUM = oushuSUM+i; //鍋舵暟鍜 }else { //鍚﹀垯鏄濂囨暟 jishuSUM = jishuSUM+i; //濂囨暟鍜 } } System.out.prin...
绛旓細1銆侀氳繃瀛楅潰瑙ｉ噴鍘诲疄鐜帮細閲囩敤鍙栨ā锛%锛夌殑鍋氭硶锛歱ublic booleam isOdd(int num){ return num % 2 != 0;}娉ㄦ剰锛氶氳繃鍙栨ā鍒ゆ柇濂鍋舵暟涓瀹氳涓0杩涜姣旇緝銆傚鏋滄槸閫氳繃涓1杩涜姣旇緝鐨勮瘽浼氭湁涓涓棶棰橈細0 % 2 = 0 ( 0 != 1 ) 鏄伓鏁1 % 2 = 1 ( 1 = 1 ) 鏄濂囨暟-1 % 2...
