test

Test/README.md

@@ -0,0 +1,4 @@
+# Git 연결 확인 test
+---
+:raised_hand:
+- 안녕

src/main/java/Problem2/FindAndRemoveDuplicate.java

@@ -0,0 +1,20 @@
+package Problem2;
+import java.util.ArrayList;
+import java.util.Arrays;
+
+public class FindAndRemoveDuplicate {
+    public String FindAndRemve (String cryptogram)
+    {
+        String[] cryptogramArray = cryptogram.split("");
+        ArrayList<String> cryptogramList = new ArrayList<String>(Arrays.asList(cryptogramArray));
+        for (int i = 0; i <cryptogramList.size() - 1; i++) {
+            if (cryptogramList.get(i).equals(cryptogramList.get(i + 1))) {
+                cryptogramList.remove(i);
+                cryptogramList.remove(i);
+                i -= 2;
+            }
+        }
+        String str = String.join("",cryptogramList);
+     return str;
+    }
+}

src/main/java/Problem2/StringValidation.java

@@ -0,0 +1,18 @@
+package Problem2;
+
+public class StringValidation {
+    public boolean Validate (String cryptogram) {
+        // 문자열 길이 오류
+        if (cryptogram.length() < 1 || cryptogram.length() > 1000) {
+            return false;
+        }
+        // 대문자 포함될 경우
+        char[] charArray = cryptogram.toCharArray();
+        for (int i = 0; i < charArray.length; i++) {
+            if (Character.isUpperCase(charArray[i])) {
+                return false;
+            }
+        }
+        return true;
+    }
+}

src/main/java/Problem2/eJun0SSockSSock.java

@@ -0,0 +1,35 @@
+package Problem2;
+
+import java.util.Stack;
+
+public class eJun0SSockSSock {
+    // 2jun0's Code
+    // 1. Stack 생성
+    // 2. for문 순회
+    // 3. push || pop
+
+    public String ConvertStackToString(Stack<Character> stack) {
+        StringBuilder sb = new StringBuilder();
+        // 후입선출 고려 0번째 index에 add가 아닌 insert 해줌.
+        while (!stack.isEmpty()) { //모두 pop() 되면 종료
+            // pop()은 제거하면서 sb에 insert도 가능한가봄
+            sb.insert(0,stack.pop());
+        }
+        return sb.toString();
+    }
+    public String RemoveDuplicate(String cryptogram) {
+        Stack<Character> stack = new Stack<Character>();
+
+        for (char c: cryptogram.toCharArray()) {
+            // 나는 문자열 비교시 equals ( 참조형 비교 위해) 썼는데 char은 기본형이라 == 시용 가능
+            if (stack.size() > 0 && stack.peek().equals(c)) {
+                stack.pop();
+            } else {
+                stack.push(c);
+            }
+        }
+        return ConvertStackToString(stack);
+    }
+
+
+}

src/main/java/Problem2/functionList.md

@@ -0,0 +1,16 @@
+# 🚀 problem2 기능 목록
+- - -
+### 1. StringValidation 
+```java
+System.out.println("예외");
+```
+- 글자수가 **1**이하 **1000** 이상일 경우
+- **대문자**가 들어올 경우
+- 빈문자열 값: ```return 빈문자열```
+- - -
+### 2. FindAndRemoveDuplicate
+- **LinkedList**로 첫 문자부터 순회
+- 반복문자 나올 시 next  node **포인터 변경** (삭제)
+- 반복이 없다면 다음 node로 이동
+- ```return 최종 문자열```
+

src/main/java/hi/Compare.java

@@ -0,0 +1,12 @@
+package hi;
+
+public class Compare {
+    public int CompareScore(Integer largePobiScore ,Integer largeCrongScore) {
+        if (largePobiScore < largeCrongScore) {
+            return 2;
+        } else if (largePobiScore > largeCrongScore) {
+            return 1;
+        }
+        return 0;
+    }
+}

src/main/java/hi/Page.java

@@ -0,0 +1,28 @@
+package hi;
+
+import java.util.List;
+import hi.Score;
+
+public class Page {
+    private static final int MIN = 3;
+    private static final int MAX =398;
+
+    public int PageValidation (List<Integer> pobi, List<Integer> crong) {
+        int pobiLeft = pobi.get(0);
+        int pobiRight = pobi.get(1);
+        int crongLeft = crong.get(0);
+        int crongRight = crong.get(1);
+
+        if (pobiRight - pobiLeft != 1 || crongRight - crongLeft != 1) {
+            return -1;
+        }
+        if (pobiLeft < MIN || pobiLeft > MAX || crongLeft < MIN || crongLeft > MAX
+                || pobiRight < MIN || pobiRight > MAX || crongRight < MIN || crongRight > MAX) {
+            return -1;
+        }
+        Score score = new Score();
+        int win = score.LargeScore(pobiLeft, pobiRight, crongLeft, crongRight);
+
+        return win;
+    }
+}

src/main/java/hi/Score.java

@@ -0,0 +1,40 @@
+package hi;
+
+import java.util.ArrayList;
+import java.util.LinkedList;
+import java.util.List;
+
+public class Score {
+    public Integer LargeScore(Integer pobiLeft, Integer pobiRight, Integer crongLeft, Integer crongRight) {
+
+        int largePobiScoreLeft = Calculate(pobiLeft);
+        int largePobiScoreRight = Calculate(pobiRight);
+        int largeCrongScoreLeft = Calculate(crongLeft);
+        int largeCrongScoreRight = Calculate(crongRight);
+
+        int largePobiScore = largePobiScoreLeft < largePobiScoreRight ? largePobiScoreRight : largePobiScoreLeft;
+        int largeCrongScore = largeCrongScoreLeft < largeCrongScoreRight ? largeCrongScoreRight : largeCrongScoreLeft;
+
+        Compare compare = new Compare();
+        int win = compare.CompareScore(largePobiScore, largeCrongScore);
+
+        return win;
+    }
+    public int Calculate (int score) {
+        LinkedList<Integer> scoreLists = new LinkedList<>();
+        while (score > 0) {
+            scoreLists.push(score % 10);
+            score /= 10;
+        }
+        int add = 0;
+        int mul = 1;
+        for (int i = 0; i < scoreLists.size(); i++) {
+            add += scoreLists.get(i);
+            mul *= scoreLists.get(i);
+        }
+
+        return add < mul ? mul : add;
+    }
+}
+
+

src/main/java/onboarding/Problem1.java

@@ -1,10 +1,13 @@
 package onboarding;
 
 import java.util.List;
+import hi.Page;
 
 class Problem1 {
     public static int solution(List<Integer> pobi, List<Integer> crong) {
-        int answer = Integer.MAX_VALUE;
-        return answer;
+        Page page = new Page();
+        int score = page.PageValidation(pobi, crong);
+        System.out.println(score);
+        return score;
     }
 }

src/main/java/onboarding/Problem2.java

@@ -1,8 +1,21 @@
 package onboarding;
+import Problem2.StringValidation;
+import Problem2.FindAndRemoveDuplicate;
+import Problem2.eJun0SSockSSock;
 
 public class Problem2 {
     public static String solution(String cryptogram) {
-        String answer = "answer";
-        return answer;
+        // 문자열 validation check return boolean
+        StringValidation stringValidation = new StringValidation();
+        if (!stringValidation.Validate(cryptogram)) {
+            return "";
+        }
+        // validation check 값이 true면 중복 삭제
+//        FindAndRemoveDuplicate FRD = new FindAndRemoveDuplicate();
+//        String result = FRD.FindAndRemve(cryptogram);
+        //2jun0's
+        eJun0SSockSSock ejun0 = new eJun0SSockSSock();
+        String result = ejun0.RemoveDuplicate(cryptogram);
+        return result;
     }
 }

src/main/java/onboarding/Problem3.java

@@ -1,8 +1,9 @@
 package onboarding;
+import problem3.NumberValidation;
 
 public class Problem3 {
     public static int solution(int number) {
-        int answer = 0;
-        return answer;
+        NumberValidation numberValidation = new NumberValidation();
+        return numberValidation.validateNumber(number);
     }
 }

src/main/java/onboarding/Problem4.java

@@ -1,7 +1,15 @@
 package onboarding;
+import problem4.WordValidation;
+import problem4.ConvertWord;
 
 public class Problem4 {
     public static String solution(String word) {
+        WordValidation wordValidation = new WordValidation();
+        if (wordValidation.ValidateWordLength(word)) {
+            ConvertWord convertWord = new ConvertWord();
+            return convertWord.IsAlphabet(word);
+        }
+
         String answer = "";
         return answer;
     }

src/main/java/onboarding/Problem6.java

@@ -1,9 +1,19 @@
 package onboarding;
 
 import java.util.List;
+import problem6.FindDuplicateNickname;
+import problem6.ValidationCheck;
 
 public class Problem6 {
     public static List<String> solution(List<List<String>> forms) {
+        ValidationCheck validationCheck = new ValidationCheck();
+        FindDuplicateNickname findDuplicateNickname = new FindDuplicateNickname();
+
+        boolean validateMemberCount =  validationCheck.MemberCountValidate(forms);
+        if (validateMemberCount) {
+            List<String> reslut = findDuplicateNickname.FindDuplicateNickname(forms);
+            return reslut;
+        }
         List<String> answer = List.of("answer");
         return answer;
     }

src/main/java/problem3/ClapCount.java

@@ -0,0 +1,28 @@
+package problem3;
+
+public class ClapCount {
+    public int CountCalp(int number) {
+        int count = 0;
+//        for (int i = 1; i <= number; ++i) {
+//             String stringNumber = Integer.toString(i);
+//            // 2번 이상일 경우
+//            for (int j = 0; j < stringNumber.length(); ++j){
+//                if (stringNumber.charAt(j) == '3' || stringNumber.charAt(j) == '6' || stringNumber.charAt(j) == '9') {
+//                    count++;
+//                }
+//            }
+//        }
+        //jiyeong's Code + (-48)
+        for (int i = 1; i < number + 1; ++i) {
+            String strNum = Integer.toString(i);
+            for (int j = 0; j < strNum.length(); ++j) {
+                int convertIntNum = strNum.charAt(j) - 48;
+                if (convertIntNum % 3 == 0 && convertIntNum != 0) {
+                    count++;
+                }
+            }
+        }
+
+        return count;
+    }
+}

src/main/java/problem3/NumberValidation.java

@@ -0,0 +1,12 @@
+package problem3;
+
+public class NumberValidation {
+    public int validateNumber (int number) {
+        if (number < 1 || number > 1000) {
+            System.out.println("1 이상 1000 이하의 숫자만 가능합니다.");
+            return -1;
+        }
+        ClapCount clapCount = new ClapCount();
+        return clapCount.CountCalp(number);
+    }
+}

src/main/java/problem3/functionList3.md

@@ -0,0 +1,9 @@
+# 🚀 problem3 기능목록
+- - -
+**1. NumberValidation**
+> - number이 1 이하 1000 이상일 경우 exception
+
+**2. ClapCount**
+> - number에 3, 6, 9 가 포함 되면 : count++;
+> - return count;
+> - 3,6,9 가 n 번 포함 되어 있을 경우는 n번 counting 

src/main/java/problem4/ConvertWord.java

@@ -0,0 +1,52 @@
+package problem4;
+
+public class ConvertWord {
+//    public String ConvertWord(String word) {
+//        char[] wordCharArray = word.toCharArray();  // 미리 선언 vs for문에서 한 번에 처리
+//        StringBuilder builder = new StringBuilder(1024);
+//        // 이 부분 리팩토링 필요 !! 23/10/18
+//        for (char c: wordCharArray) {
+//            if (c > 64 && c < 91) {
+//                // 대문자 > 대문자
+//                int T = 90 - (c - 65);
+//                builder.append((char)T);
+//            } else if (c > 96 && c < 123) {
+//                // 소문자 > 소문자
+//                int t = 122 - (c - 97);
+//                builder.append((char)t);
+//            } else if (c == 32) {
+//                // 스페이스
+//                builder.append(c);
+//            }
+//        }
+//        return builder.toString();
+//    }
+    public char ConvertAlphabet(char c) {
+        char startIdx = ' ';
+        char lastIdx = ' ';
+
+        // 대소문자 구분
+        if (Character.isUpperCase(c)) {
+            startIdx = 'A'; // 대문자
+            lastIdx = 'Z';
+        } else {
+            startIdx = 'a'; // 소문자
+            lastIdx = 'z';
+        }
+        return (char)(lastIdx - (c - startIdx));
+    }
+    public String IsAlphabet (String word) {
+        StringBuilder builder = new StringBuilder(1024);
+        // 2jun0 + me
+        for (char c: word.toCharArray()) {  // 선언하지 않고 for문에서 한 번에 처리
+            if (Character.isAlphabetic(c)) {
+                // 알파벳일 경우 convert
+                builder.append(ConvertAlphabet(c));
+            } else {
+                // !, ' ', ~ 등등은 그대로 append
+                builder.append(c);
+            }
+        }
+        return builder.toString();
+    }
+}