728x90

using System;

public class Solution {
    public string[] solution(string my_str, int n) {
        string[] answer = new string[(my_str.Length+n-1)/n];
        int j=0;
        int i=0;
        
        for(i=0;i<(my_str.Length+n-1)/n;i++)
        {
            for(j=n*i;j<n*i+n;j++) ///
            {
                if(j < my_str.Length)
                {
                    answer[i] += my_str[j];    
                }
            }
        }
        
        return answer;
    }
}

 

 

파이썬

//////

 

def solution(my_str, n):
    return [my_str[i: i + n] for i in range(0, len(my_str), n)]

/////////

def solution(my_str, n):
    answer = []

    while len(my_str) > n:
        answer.append(my_str[:n])
        my_str = my_str[n:]

    if my_str != "":
        answer.append(my_str)

    return answer

 

자바

/////

 

import java.util.List;
import java.util.ArrayList;

class Solution {
    public String[] solution(String my_str, int n) {
        List<String> answer = new ArrayList<>();
        String str = "";
        
        for(int i=0; i<my_str.length(); i++)
        {
            str += my_str.charAt(i);
            
            if(str.length() == n || i == my_str.length()-1)
            {
                answer.add(str);
                str = "";
            }
        }

        return answer.stream().map(s -> s).toArray(String[]::new);
    }
}

 

 

import java.util.ArrayList;

class Solution {
    public ArrayList solution(String my_str, int n) {
        ArrayList<String> answer = new ArrayList<>();
        int i=0;
        
        while(true)
        {
            if(i+n>=my_str.length())
            {
                answer.add(my_str.substring(i, my_str.length()));
                break;
            }
            
            answer.add(my_str.substring(i, i+n));
            i+=n;
        }
        return answer;
    }
}

 

728x90

설정

트랙백

댓글