κ³μ°κΈ° PR μλ£!
λμ μ€ λ건 κ΅° κ³ λ§μμ...
+) 22. 06. 26. λλ§ μ΄ν΄ κ°λ₯νκ² μ§λ§ μ΄μ¨λ λ건μ΄μκ² λ°°μ΄ PR νλ λ² κΈ°λ‘
β¬οΈ
λμ κ³μ°κΈ° -> λ΄ main λΈλμΉ λ§λ€κΈ° -> λ΄ main λΈλμΉλ₯Ό fork λ¨κΈ° -> fork λ¬ κ³³(λ΄ main)μ λ΄ working λΈλμΉ λ§λ€κΈ° -> λ΄ working λΈλμΉλ₯Ό ν΄λ‘ λ μ μμ νκΈ°
λͺ
λ Ήμ΄
git clone μ£Όμ //ν΄λ‘ λ¨κΈ°
git branch //νμ¬ λΈλμΉκ° μ΄λ€ κ±΄μ§ νμΈ
git checkout λΈλμΉ //λΈλμΉ λ³κ²½
day8 π μ μΆκ° μλ£!
day8 π μ μΆκ° μλ£!
class Solution {
boolean solution(String s) {
boolean answer = true;
int countP = 0;
int countY = 0;
for(int i = 0; i<s.length(); i++) {
if(s.charAt(i)=='p' || s.charAt(i)=='P') {
countP++;
}
else if(s.charAt(i)=='y' || s.charAt(i)=='Y') {
countY++;
}
}
if(countP==countY) {
answer = true;
}
else {
answer = false;
}
return answer;
}
}
β‘οΈ μ΄κ±΄ λ€λ₯Έ μ¬λλ€ νμ΄ λ³΄λκΉ λκ° λλ€μμΌλ‘ 쑰건 μ€μ μμ² κ°κ²°νκ² νμλλ°... λλ€μμ λν΄μλ μμλ΄μΌ ν κ² κ°λ€.
class Solution {
public String solution(int n) {
String answer = "";
for(int i=0; i<n; i++) {
if(i%2 == 0)
answer += "μ";
else
answer += "λ°";
}
return answer;
}
}