How to Determine the Leap Year?
- 时间:2020-09-21 09:15:21
- 分类:网络文摘
- 阅读:133 次
A Leap year occurs mostly every 4 years, but every 100 years, we skip a leap year, unless it is divisible by 400.
Leap Year Algorithm
if (year is not divisible by 4) then (it is a common year)
else if (year is not divisible by 100) then (it is a leap year)
else if (year is not divisible by 400) then (it is a common year)
else (it is a leap year)
How to Test Leap Year in C++?
1 2 3 4 5 6 7 8 9 10 11 | bool isLeap(int Y) { if (Y % 400 == 0) { return true; } else if ( Y % 100 == 0) { return false; } else if (Y % 4 == 0) { return true; } else { return false; } } |
bool isLeap(int Y) {
if (Y % 400 == 0) {
return true;
} else if ( Y % 100 == 0) {
return false;
} else if (Y % 4 == 0) {
return true;
} else {
return false;
}
}Or shorter:
1 2 3 | bool isLeap(int Y) { return (Y % 400 == 0) || ((Y % 100 != 0) && (Y % 4 == 0)); } |
bool isLeap(int Y) {
return (Y % 400 == 0) || ((Y % 100 != 0) && (Y % 4 == 0));
}How to Test Leap Year in C?
1 2 3 4 5 6 7 8 9 10 11 | int isLeap(int Y) { if (Y % 400 == 0) { return true; } else if ( Y % 100 == 0) { return false; } else if (Y % 4 == 0) { return true; } else { return false; } } |
int isLeap(int Y) {
if (Y % 400 == 0) {
return true;
} else if ( Y % 100 == 0) {
return false;
} else if (Y % 4 == 0) {
return true;
} else {
return false;
}
}Or shorter:
1 2 3 | int isLeap(int Y) { return (Y % 400 == 0) || ((Y % 100 != 0) && (Y % 4 == 0)); } |
int isLeap(int Y) {
return (Y % 400 == 0) || ((Y % 100 != 0) && (Y % 4 == 0));
}How to Test Leap Year in Java?
1 2 3 4 5 6 7 8 9 10 11 | boolean isLeap(int Y) { if (Y % 400 == 0) { return true; } else if ( Y % 100 == 0) { return false; } else if (Y % 4 == 0) { return true; } else { return false; } } |
boolean isLeap(int Y) {
if (Y % 400 == 0) {
return true;
} else if ( Y % 100 == 0) {
return false;
} else if (Y % 4 == 0) {
return true;
} else {
return false;
}
}Or shorter:
1 2 3 | boolean isLeap(int Y) { return (Y % 400 == 0) || ((Y % 100 != 0) && (Y % 4 == 0)); } |
boolean isLeap(int Y) {
return (Y % 400 == 0) || ((Y % 100 != 0) && (Y % 4 == 0));
}How to Test Leap Year in Javascript?
1 2 3 4 5 6 7 8 9 10 11 | var isLeap = function(Y) { if (Y % 400 == 0) { return true; } else if ( Y % 100 == 0) { return false; } else if (Y % 4 == 0) { return true; } else { return false; } } |
var isLeap = function(Y) {
if (Y % 400 == 0) {
return true;
} else if ( Y % 100 == 0) {
return false;
} else if (Y % 4 == 0) {
return true;
} else {
return false;
}
}Or shorter:
1 2 3 | var isLeap = function(Y) { return (Y % 400 == 0) || ((Y % 100 != 0) && (Y % 4 == 0)); } |
var isLeap = function(Y) {
return (Y % 400 == 0) || ((Y % 100 != 0) && (Y % 4 == 0));
}How to Test Leap Year in Python/Python3?
1 2 3 4 5 6 7 8 9 | def isLeap(Y): if Y % 400 == 0: return True elif Y % 100 == 0: return False elif Y % 4 == 0: return True else: return False |
def isLeap(Y):
if Y % 400 == 0:
return True
elif Y % 100 == 0:
return False
elif Y % 4 == 0:
return True
else:
return Falseor shorter:
1 2 | def isLeap(Y): return (Y % 400 == 0) or ((Y % 100 != 0) and (Y % 4 == 0)) |
def isLeap(Y):
return (Y % 400 == 0) or ((Y % 100 != 0) and (Y % 4 == 0)) All Leap Year Algorithms run at O(1) time and O(1) constant space.
–EOF (The Ultimate Computing & Technology Blog) —
推荐阅读:厂家称没法根本解决五芳斋粽子发霉 饮食保健:盘点枸杞的十大养生功效 食物为何会致癌及常见致癌物来源 肯德基麦当劳可食用冰块菌落超标 南瓜的保健作用:降血糖血脂、防癌 大暑养生:暑天应多吃清淡易消化食物 市场热俏的功能性饮料到底是什么? 不能把功能性饮料完全代替饮用水 功能性饮料应该如何科学合理的饮用 网传的10种致癌食物中有9种不靠谱
- 评论列表
-
- 添加评论