How to Determine the Leap Year?

  • 时间:2020-09-21 09:15:21
  • 分类:网络文摘
  • 阅读:96 次

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 False

or 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) —

推荐阅读:
纬来体育台直播「高清」  台湾宏观卫视直播「高清」  壹电视综合台在线直播「高清」  壹电视新闻台直播「高清」  台湾GTH八大综合台在线直播「高清」  台湾台视直播-台视在线直播  台湾华视直播「高清」  取消Windows Server 2008 R2密码过期提示  台湾民视直播-台湾民视在线直播「高清」 
评论列表
添加评论