class Solution { public int[] solution(int[] numbers) { int[] answer = numbers; for (int i = 0; i < answer.length; i++) { answer[i] = answer[i] * 2; } return answer; } }
class Solution { public int solution(String my_string) { int answer = 0; for (int i = 0; i = 48 && i1
class Solution { public int solution(int price) { int answer = price; if (price >= 500000) { return (int) (price * 0.8); } else if (price >= 300000) { return (int) (price * 0.9); } else if (price >= 100000) { return (int) (price * 0.95); } return answer; } }
import java.util.ArrayList; import java.util.List; class Solution { public int[] solution(int[] numbers, String direction) { List answer = new ArrayList(); if (direction.equals("right")) { answer.add(numbers[numbers.length-1]); for (int i = 0; i < numbers.length - 1; i++) { answer.add(numbers[i]); } } else { for (int i = 1; i < numbers.length; i++) { answer.add(numbers[i]); } answer.add(numbers[..
class Solution { public int solution(int[] numbers, int k) { int answer = 0; for (int i = 0; i < k; i++) { answer = numbers[((k - 1) * 2) % numbers.length]; } return answer; } }
import java.util.List; import java.util.function.Predicate; import java.util.stream.Collectors; import java.util.stream.IntStream; class Solution { public int solution(String my_string, String is_suffix) { List collect = IntStream.range(0, my_string.length()) .mapToObj(my_string::substring) .collect(Collectors.toList()); return collect.stream().anyMatch(Predicate.isEqual(is_suffix)) ? 1 : 0; } }..
import java.util.Arrays; class Solution { public String[] solution(String my_string) { String[] answer = new String[my_string.length()]; for (int i = 0; i < my_string.length(); i++) { answer[i] = my_string.substring(i); } Arrays.sort(answer); return answer; } }
import java.util.ArrayList; import java.util.List; class Solution { public int[] solution(int n) { List answer = new ArrayList(); answer.add(n); while (n > 1) { n = n % 2 == 0 ? n / 2 : 3 * n + 1; answer.add(n); } return answer.stream().mapToInt(Integer::valueOf).toArray(); } }
