Last active
November 17, 2025 02:22
-
-
Save PurpleBananass/2b3a05da974645adf6508ac46611699e to your computer and use it in GitHub Desktop.
Code Review Exercise
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| public class CodeReviewEx { | |
| public static void main(String[] args) { | |
| System.out.println("This will be printed"); | |
| } | |
| /* Q1 ~ Q6 (dayOfYear) */ | |
| public static int dayOfYear(int month, int dayOfMonth, int year) { | |
| if (month == 2) { | |
| dayOfMonth += 31; | |
| } else if (month == 3) { | |
| dayOfMonth += 59; | |
| } else if (month == 4) { | |
| dayOfMonth += 90; | |
| } else if (month == 5) { | |
| dayOfMonth += 31 + 28 + 31 + 30; | |
| } else if (month == 6) { | |
| dayOfMonth += 31 + 28 + 31 + 30 + 31; | |
| } else if (month == 7) { | |
| dayOfMonth += 31 + 28 + 31 + 30 + 31 + 30; | |
| } else if (month == 8) { | |
| dayOfMonth += 31 + 28 + 31 + 30 + 31 + 30 + 31; | |
| } else if (month == 9) { | |
| dayOfMonth += 31 + 28 + 31 + 30 + 31 + 30 + 31 + 30; | |
| } else if (month == 10) { | |
| dayOfMonth += 31 + 28 + 31 + 30 + 31 + 30 + 31 + 30 + 30; | |
| } else if (month == 11) { | |
| dayOfMonth += 31 + 28 + 31 + 30 + 31 + 30 + 31 + 30 + 30 + 31; | |
| } else if (month == 12) { | |
| dayOfMonth += 31 + 28 + 31 + 30 + 31 + 30 + 31 + 30 + 30 + 31 + 31; | |
| } | |
| return dayOfMonth; | |
| } | |
| /* Q7 ~ Q10 (leap) */ | |
| public static boolean leap(int y) { | |
| String tmp = String.valueOf(y); | |
| if (tmp.charAt(2) == '1' || tmp.charAt(2) == '3' || tmp.charAt(2) == 5 || tmp.charAt(2) == '7' || tmp.charAt(2) == '9') { | |
| if (tmp.charAt(3)=='2'||tmp.charAt(3)=='6') return true; /*R1*/ | |
| else | |
| return false; /*R2*/ | |
| }else{ | |
| if (tmp.charAt(2) == '0' && tmp.charAt(3) == '0') { | |
| return false; /*R3*/ | |
| } | |
| if (tmp.charAt(3)=='0'||tmp.charAt(3)=='4'||tmp.charAt(3)=='8')return true; /*R4*/ | |
| } | |
| return false; /*R5*/ | |
| } | |
| /* Q11 ~ Q12 (countLongWords) */ | |
| public static int LONG_WORD_LENGTH = 5; | |
| public static String longestWord; | |
| public static void countLongWords(List<String> words) { | |
| int n = 0; | |
| longestWord = ""; | |
| for (String word: words) { | |
| if (word.length() > LONG_WORD_LENGTH) ++n; | |
| if (word.length() > longestWord.length()) longestWord = word; | |
| } | |
| System.out.println(n); | |
| } | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment