알고리즘 코드카타
가운데 글자 가져오기
class Solution {
public String solution(String s) {
int len = s.length()/2;
if(s.length() % 2 != 0){
return s.substring(len, len+1);
}
return s.substring(len-1, len + 1);
}
}
수박수박수박수박수박수?
class Solution {
public String solution(int n) {
String answer = "";
int i = Math.round((float) n/2);
for(int j=0;j<i;j++){
answer += "수박";
}
return answer.substring(0,n);
}
}
class Solution {
public String solution(int n) {
return IntStream.range(0, n)
.mapToObj(i -> (i % 2 == 0) ? "수" : "박")
.collect(Collectors.joining());
}
}
내적
class Solution {
public int solution(int[] a, int[] b) {
int answer = 0;
int size = a.length;
for(int i=0; i<size; i++){
answer += a[i]*b[i];
}
return answer;
}
}
약수의 개수와 덧셈
class Solution {
public int solution(int left, int right) {
int answer = 0;
int count;
for(int i=left; i<=right;i++){
count = 0;
for(int j=1;j<=i;j++){
if(i%j==0){
count++;
}
}
if(count%2 == 0){
answer += i;
}else{
answer -= i;
}
}
return answer;
}
}
문자열 내림차순으로 배치하기
import java.util.Arrays;
class Solution {
public String solution(String s) {
char[] arr = s.toCharArray();
Arrays.sort(arr);
StringBuilder sb = new StringBuilder(String.valueOf(arr));
sb.reverse();
return String.valueOf(sb);
}
}