Problem
Objective
Today we're expanding our knowledge of Strings and combining it with what we've already learned about loops. Check out the Tutorial tab for learning materials and an instructional video!
Task
Given a string, , of length that is indexed from to , print its even-indexed and odd-indexed characters as space-separated strings on a single line (see the Sample below for more detail).
Note: is considered to be an even index.
Input Format
The first line contains an integer, (the number of test cases).
Each line of the subsequent lines contain a String, .
Constraints
Output Format
For each String (where ), print 's even-indexed characters, followed by a space, followed by 's odd-indexed characters.
Sample Input
2
Hacker
Rank
Sample Output
Hce akr
Rn ak
Explanation
Test Case 0:
The even indices are , , and , and the odd indices are , , and . We then print a single line of space-separated strings; the first string contains the ordered characters from 's even indices (), and the second string contains the ordered characters from 's odd indices ().
Test Case 1:
The even indices are and , and the odd indices are and . We then print a single line of space-separated strings; the first string contains the ordered characters from 's even indices (), and the second string contains the ordered characters from 's odd indices ().
How I solved the problem
# 반복문이 돌았을 때 해당 index의 위치가 짝수인지 홀수인지를 판단하여 각 char를 모으는 문제
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 | import java.io.*; import java.util.*; public class Solution { public static void main(String[] args) { /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */ Scanner scanner = new Scanner(System.in); int count = Integer.parseInt(scanner.nextLine().trim()); for (int i = 0; i < count; i++) { String evenStr = ""; String oddStr = ""; String inputStr = scanner.nextLine().trim(); for (int j = 0; j < inputStr.length(); j++) { if (j % 2 == 0) { evenStr += inputStr.charAt(j); } else { oddStr += inputStr.charAt(j); } } System.out.println(evenStr + " " + oddStr); } scanner.close(); } } | cs |
[출처 : https://www.hackerrank.com ]
'1 Day 1 Algorithms' 카테고리의 다른 글
[2018.12.18] Arrays (0) | 2018.12.18 |
---|---|
[2018.12.17] Plus Minus (0) | 2018.12.17 |
[2018.12.16] Loops (0) | 2018.12.17 |
[2018.12.15] Class vs. Instance (0) | 2018.12.17 |
[2018.12.14] A Very Big Sum (0) | 2018.12.14 |
댓글