국내주식 / 일본주식 / 개발자이야기

using System;

public class Solution {
    public string solution(string my_string) {   
        string answer = "";
        char[] arr = my_string.ToCharArray();
        Array.Reverse(arr);

        for(int i = 0; i < arr.Length; i++)
        {
            answer += arr[i];
        }
        return answer;
    }
}

// Reverse를 몰라서 퍼왔다.

using System;

public class Solution {
    public string solution(string my_string) {
        string answer = "";
        
        for(int i = my_string.Length-1;i>=0;i--)
            answer += my_string[i];
            
        return answer;
    }
}

//Reverse안하고 그냥 뒤에서 부터 거꾸로 때려박기도 한다.

파이썬

////

def solution(my_string):
    answer = ''

    for i in range(len(my_string)-1, -1, -1) :
        answer += my_string[i]
    return answer

////

def solution(my_string):
    return my_string[::-1]

자바

import java.util.*;

class Solution {
    public String solution(String my_string) {
        StringBuilder sb = new StringBuilder();
        sb.append(my_string);
        sb.reverse();

        return sb.toString();
    }
}

class Solution {
    public String solution(String my_string) {
        String answer = "";

        for(int i=my_string.length()-1; i>=0; i--)
        {
            answer += my_string.charAt(i);
        }

        return answer;
    }
}

using System;

public class Solution {
    public int[] solution(int[] num_list) {
        int[] answer = new int[2];

        for(int i=0; i<num_list.Length;i++)
        {
            if(num_list[i] % 2 == 0)
            {
                answer[0]++;
            }   /// 짝수면 첫 번째 0배열에 플러스 1씩 해준다.
            else
            {
                answer[1]++;
            } //홀수면 배열 1에 플러스 1씩 한다.
        }
        
        return answer;
    }
}

파이썬

////

def solution(num_list):
    answer = [0,0]
    for n in num_list:
        answer[n%2]+=1
    return answer

2

////

def solution(num_list):
    answer = [0,0]

    for num in num_list:
        if num % 2 == 0:
            answer[0] += 1
        else:
            answer[1] += 1

    return answer

자바

class Solution {
    public int[] solution(int[] num_list) {
        int[] answer = new int[2];

        for(int i = 0; i < num_list.length; i++)
            answer[num_list[i] % 2]++;

        return answer;
    }
}

using System;
public class Solution
{
    public int solution(int[] dot)
    {
        int answer = dot[0] > 0 ? (dot[1] > 0 ? 1 : 4) : (dot[1] > 0 ? 2 : 3);
        return answer;
    }
}

////

using System;

public class Solution {
    public int solution(int[] dot) {
        int answer = 0;
        if(dot[0] > 0 && dot[1] > 0)
        {
            answer = 1;
        }
        else if(dot[0] > 0 && dot[1] < 0)
            {
                answer = 4;
            }
        else if(dot[0] < 0 && dot[1] < 0)
        {
            answer = 3;
        }
        else 
        { answer = 2;
        }
        return answer;
    }
}

////

파이썬

def solution(dot):
    quad = [(3,2),(4,1)]
    return quad[dot[0] > 0][dot[1] > 0]

////////

def solution(dot):
    a, b = 1, 0
    if dot[0]*dot[1] > 0:
        b = 1
    if dot[1] < 0:
        a = 2
    return 2*a-b

자바

class Solution {
    public int solution(int[] dot) {
        return dot[0] > 0 && dot[1] > 0 ? 1 : dot[0] < 0 && dot[1] > 0 ? 2 : dot[0] > 0 && dot[1] < 0 ? 4 : 3;
    }
}

class Solution {
    public int solution(int[] dot) {
        int answer = 0;
        
        if(dot[0] > 0 && dot[1] > 0)
        {
            answer = 1;
        }
        else if(dot[0] > 0 && dot[1] < 0)
        {
            answer = 4;
        }
        else if(dot[0] < 0 && dot[1] > 0)
        {
            answer = 2;
        }
        else if(dot[0] < 0 && dot[1] < 0)
        {
            answer = 3;
        }
        return answer;
    }
}

using System;

public class Solution
{
    public int solution(int n)
    {
        return (int)Math.Ceiling((double)n / 7);
    }
}

///

using System;
public class Solution
{
    public int solution(int n)
    {
        int answer = n / 7 + (n % 7 == 0 ? 0 : 1);

/* int answer = n/7;

if(n%7 != 0 )

{

answer += 1; 나머지가 0이면 그대로가고, 0이 아니면 1을 더해준다.

}*/
        return answer;
    }
}

파이썬

///

def solution(n):
    return (n - 1) // 7 + 1

자바

class Solution {
    public int solution(int n) {
        return (n + 6) / 7;
    }
}

class Solution {
    public int solution(int n) {
        int answer = (n%7==0) ? n/7 : n/7 + 1;

        return answer;
    }
}

using System;

public class Solution {
    public int[] solution(string[] strlist) {
        int[] answer = new int[strlist.Length];

        for (int i = 0; i < strlist.Length; i++)
        {
            answer[i] = strlist[i].Length;
        }

// 각 Array에서 string Length를 취득한다.
        return answer;
    }
}

///////////

자바

class Solution {
    public int[] solution(String[] strlist) {
        int[] answer = new int[strlist.length];

        for(int i=0; i<strlist.length;i++)
        {
            answer[i]= strlist[i].length();
        }
        
        return answer;
    }
}

import java.util.Arrays;

class Solution {
    public int[] solution(String[] strList) {
        return Arrays.stream(strList).mapToInt(String::length).toArray();
    }
}

using System;

public class Example
{
    public static void Main()
    {
        String[] s;

        Console.Clear();
        s = Console.ReadLine().Split(' ');

        int n = Int32.Parse(s[0]);

        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= i; j++)
            {
                Console.Write("*");
            }
            Console.WriteLine();
        }
    }
}

파이썬

n = int(input())
for i in range(n):
    print('*'*(i+1))

//////

n = int(input())
for i in range(1,n+1):
    print('*'*i)

자바

import java.util.Scanner;

public class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        for(int i=1; i<=n; i++)
        {
            System.out.println("*".repeat(i));
        }
    }
}

import java.util.Scanner;

public class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        for(int i=0; i<n; i++)
        {
            for(int j=0; j<=i; j++)
            {
                System.out.print("*");
            }
            
            System.out.println();
        }

    }
}

using System;
using System.Linq;

public class Solution {
    public int solution(int k, int m, int[] score) {
        int answer = 0;
        int index = m-1; // m개씩 나누는데 배열은 0부터 시작하니까 -1해줌.
        Array.Sort(score); // 숫자 크기 순서대로 정렬한 뒤에
        Array.Reverse(score); // 배열을 뒤집어서 가장 높은 숫자가 각 박스의 맨 앞에 오도록 해서

        for(int i = 0; i < score.Length / m; i++)
        {
            answer += score[index] * m; // 숫자가 가장 높은 과일에 곱하기를 해서 점수를 매긴다.
            index += m; // m개씩 나누니까 다음 박스를 계산하게 하기 위해서 플러스m을 해준다.
        }
        
        return answer;
    }
}

//

using System;

public class Solution {
    public int solution(int k, int m, int[] score) {
        int answer = 0;
        int[] kList = new int[k+1];
        for(int i=0;i<k+1;i++)
        {
            kList[i] = 0;
        }
        for(int i=0;i<score.Length;i++)
        {
            kList[score[i]]++;
        }
        for(int i=k;i>=1;i--)
        {
            while(kList[i] >= m)
            {
                answer += i * m;
                kList[i] -= m;
            }
            kList[i-1] += kList[i];
        }


        return answer;
    }
}

자바

import java.util.*;

class Solution {
    public int solution(int k, int m, int[] score) {
        int answer = 0;
        Arrays.sort(score);

        for(int i = score.length; i >= m; i -= m)
        {
            answer += score[i - m] * m;
        }

        return answer;
    }
}

using System;

public class Program
{
    public static void Main()
    {
        Console.WriteLine("+===================================================+");
        Console.WriteLine("|                궁극의 숫자야구 게임               |");
        Console.WriteLine("+===================================================+");
        Console.WriteLine("|컴퓨터가 수비수가 되어 세 자릿수를 하나 골랐습니다.|");
        Console.WriteLine("|각 숫자는 0~9중에 하나며 중복되는 숫자는 없습니다. |");
        Console.WriteLine("|     모든 숫자와 위치를 맞히면 승리합니다.         |");
        Console.WriteLine("|    숫자와 순서가 둘 다 맞으면 스트라이크입니다.   |");
        Console.WriteLine("|     숫자만 맞고 순서가 틀리면 볼입니다.           |");
        Console.WriteLine("|    숫자가 틀리면 아웃입니다.                      |");
        Console.WriteLine("+===================================================+");

        Console.WriteLine("> 수비수가 고른 숫자");
        int number1 = 3;
        int number2 = 1;
        int number3 = 9;
        Console.WriteLine(number1);
        Console.WriteLine(number2);
        Console.WriteLine(number3);

        Console.WriteLine(" > 첫 번째 숫자를 입력하세요.");
        int guess1 = int.Parse(Console.ReadLine());
        Console.WriteLine(" > 두 번째 숫자를 입력하세요.");
        int guess2 = int.Parse(Console.ReadLine());
        Console.WriteLine(" > 세 번째 숫자를 입력하세요.");
        int guess3 = int.Parse(Console.ReadLine());

        Console.WriteLine(" > 공격수가 고른 숫자");
        Console.WriteLine(guess1);
        Console.WriteLine(guess2);
        Console.WriteLine(guess3);

        int strikeCount = 0;
        int ballCount = 0;

        if (guess1 == number1)
        {
            strikeCount = strikeCount + 1;
        }
        else if (guess1 == number2 || guess1 == number3)
        {
            ballCount = ballCount + 1;
        }

        if (guess2 == number2)
        {
            strikeCount = strikeCount + 1;
        }
        else if (guess2 == number1 || guess2 == number3)
        {
            ballCount = ballCount + 1;
        }

        if(guess3 == number3)
        {
            strikeCount = strikeCount + 1;
        }
        else if(guess3 == number1 || guess3 == number2)
        {
            ballCount = ballCount + 1;
        }

        Console.Write("스트라이크: ");
        Console.WriteLine(strikeCount);
        Console.Write("볼: ");
        Console.WriteLine(ballCount);
        Console.Write("아웃: ");
        Console.WriteLine(3-strikeCount-ballCount);
    }
}