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

using System;
class Program
{
    static void Main()
    {
        // 自分の得意な言語で
        // Let's チャレンジ！！
        var line = Console.ReadLine();
        line = line.Replace("a", "");
        line = line.Replace("i", "");
        line = line.Replace("u", "");
        line = line.Replace("e", "");
        line = line.Replace("o", "");
        line = line.Replace("A", "");
        line = line.Replace("I", "");
        line = line.Replace("U", "");
        line = line.Replace("E", "");
        line = line.Replace("O", "");
        
        Console.WriteLine(line);
    }
}

영어 이름을 입력받았을 때 모음을 없앤 내용을 출력하는 문제.

위에 받는 숫자 A가 주식을 매수한 가격이고, 아래에 받는 숫자 B가 매도한 가격이다.

매수한 가격이 매도한 가격보다 높으면 손해니까 No를 출력하게 하고 그 반대는 Yes를 출력하게 한다. A랑 B가 같은 경우는 없다.

using System;
class Program
{
    static void Main()
    {
        // 自分の得意な言語で
        // Let's チャレンジ！！
        var line = Console.ReadLine();
        var line2 = Console.ReadLine();
        
        if(int.Parse(line) > int.Parse(line2))
        {
            Console.WriteLine("No");    
        }
        else
        {
            Console.WriteLine("Yes");
        }
        
    }
}

using System;
class Program
{
    static void Main()
    {
        // 自分の得意な言語で
        // Let's チャレンジ！！
        var line = Console.ReadLine();
        
        for(int i = 0;i<line.Length+1;i++)
        {
            Console.Write("+");    
        }
        
        Console.WriteLine("+");
        Console.WriteLine("+" + line + "+");
        
        for(int i = 0;i<line.Length+2;i++)
        {
            Console.Write("+");    
        }
    }
}

데이터 형별 크기, 형태, 적는 방법, 값의 범위를 나타낸다.

using System;

public class Solution {
    public int solution(int n, int m, int[] section) {
        int answer = 0;
        int paint = 0;

            for(int i = 0; i<section.Length;i++)
            {
                if(section[i] > paint)
                {
                    paint = section[i] + m - 1;
                    answer++;
                }
            }
      
        return answer;
    }
}

//////

자바

class Solution {
    public int solution(int n, int m, int[] section) {
        int roller = section[0];
        int cnt = 1;
        
        for(int i = 1; i < section.length; i++) 
        {
            if(roller + m - 1 < section[i]) 
            {
                cnt++;
                roller = section[i];
            }
        }
        return cnt;
    }
}

using System;

public class Solution {
    public int solution(string[] babbling) {
        int answer = 0;
        string str = "";
        
        for(int i = 0;i<babbling.Length;i++)
        {
            babbling[i] = babbling[i].Replace("aya","1");
            babbling[i] = babbling[i].Replace("ye","2");
            babbling[i] = babbling[i].Replace("woo","3");
            babbling[i] = babbling[i].Replace("ma","4");
            
            babbling[i] = babbling[i].Replace("11","0");
            babbling[i] = babbling[i].Replace("22","0");
            babbling[i] = babbling[i].Replace("33","0");
            babbling[i] = babbling[i].Replace("44","0");
            
            str = babbling[i].Replace("1", string.Empty).Replace("2", string.Empty).Replace("3", string.Empty).Replace("4", string.Empty);
            
            if(str == "")
            {
                answer++;
            }
        }
      
        return answer;
    }
}

////

using System;

public class Solution {
    public int solution(string[] babbling) {
        int answer = 0;
        string[] babb = {"aya", "ye", "woo", "ma"};

           for(int i=0; i < babbling.Length; i++)
           {
                for(int j=0; j < babb.Length; j++)
                {
                    string temp = babb[j] + babb[j];
                    babbling[i] = babbling[i].Replace(temp,"1");
                    babbling[i] = babbling[i].Replace(babb[j]," ");
                }

                if(babbling[i].Trim().Length == 0)
                {
                    answer++;
                }
           }
        return answer;
    }
}

자바

using System;

public class Solution {
    public int solution(string[] babbling) {
        int answer = 0;
        string[] babb = {"aya", "ye", "woo", "ma"};

           for(int i=0; i < babbling.Length; i++)
           {
                for(int j=0; j < babb.Length; j++)
                {
                    string temp = babb[j] + babb[j];
                    babbling[i] = babbling[i].Replace(temp,"1");
                    babbling[i] = babbling[i].Replace(babb[j]," ");
                }

                if(babbling[i].Trim().Length == 0)
                {
                    answer++;
                }
           }
        return answer;
    }
}

C#

using System;

public class Solution {
    public int[] solution(int n) {
        int[] answer = new int[(n*(n+1))/2]; //배열의 총크기
        int[,] temp = new int[n,n];         //2차원 배열

        int x = -1, y = 0;
        int num = 1;

        for (int i = 0; i < n; i++) 
        {
            for (int j = i; j < n; j++) 
            { 
                if (i % 3 == 0) 
                {         //왼쪽대각선으로 진행시
                    x++;
                } 
                else if (i % 3 == 1) 
                {  //오른쪽으로 진행시
                    y++;
                } 
                else if (i % 3 == 2) 
                {  //오른쪽 대각선 진행시
                    x--;
                    y--;
                }
                temp[x,y] = num++;
            }
        }
        
        int k = 0;
        
        for(int i = 0; i < n; i++) 
        {
            for(int j = 0; j < n; j++) 
            {
                if(temp[i,j] == 0) 
                 break;
                answer[k++] = temp[i,j];
            }
        }
        return answer;
    }
}

///////////////////

using System;

public class Solution
    {
        public int[] solution(int n)
        {
            if (n == 1)
            {
                return new int[] { 1 };
            }
            int[] answer = null;

            int count = n * (n + 1) / 2;
            int[,] arrBoard = new int[n, n];

            int[] xDir = { 1, 0, -1 };
            int[] yDir = { 0, 1, -1 };

            int dir = 0;

            int num = 0;
            int x = 0;
            int y = 0;
            while (num < count)
            {
                num++;
                arrBoard[x, y] = num;

                if (dir == 0 && x + 1 == n)
                {
                    dir += 1;
                }
                if (dir == 1 && y + 1 == n)
                {
                    dir += 1;
                }
                if (arrBoard[x + xDir[dir], y + yDir[dir]] == 0)
                {
                    x = x + xDir[dir];
                    y = y + yDir[dir];
                }
                else
                {
                    dir = (dir + 1) % 3;
                    x = x + xDir[dir];
                    y = y + yDir[dir];
                }
            }

            answer = new int[count];
            int idx = 0;
            for (int i = 0; i < n; i++)
            {
                for (int j = 0; j <= i; j++)
                {
                    answer[idx] = arrBoard[i, j];
                    idx++;
                }
            }

            return answer;
        }
    }

///////

자바

class Solution {
    public int[] solution(int n) {
        int[][] li = new int[n][n];
        int x=0,y=0;
        int step = n;
        int value=1;
        while(step >0){
            /*아래로 이동 */
            for(int i=step;i>0;i--){
                li[x++][y] = value++;
            }
            x--; // 행 복귀 
            y++; // 로테이션
            step--; // 스텝 업데이트

            /* 오른쪽 이동 */
            for(int i=step;i>0;i--){
                li[x][y++] = value++;
            }
            y--; // 열 복귀
            x--; // 로테이션
            y--; // 로테이션
            step--;

            /* 북서쪽 이동 */
            for(int i=step;i>0;i--){
                li[x--][y--] = value++;
            }
            x++; // 행 복귀
            y++; // 열 복귀
            x++; // 로테이션
            step--;
        }

        int[] answer = new int[n*(n+1)/2];
        int size=0;
        
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                if(li[i][j]==0) break;
                answer[size++] = li[i][j];
            }
        }
        return answer;
    }
}

class Solution {
    public int[] solution(int n) {
        int[] answer = new int[(n*(n+1))/2];
        int[][] matrix = new int[n][n];

        int x = -1, y = 0;
        int num = 1;

        for (int i = 0; i < n; ++i) {
            for (int j = i; j < n; ++j) {
                if (i % 3 == 0) {
                    ++x;
                } else if (i % 3 == 1) {
                    ++y;
                } else if (i % 3 == 2) {
                    --x;
                    --y;
                }
                matrix[x][y] = num++;
            }
        }

        int k = 0;
        for(int i = 0; i < n; ++i) {
            for(int j = 0; j < n; ++j) {
                if(matrix[i][j] == 0) break;
                answer[k++] = matrix[i][j];
            }
        }

        return answer;
    }
}

C#

using System;

public class Solution {
    public string solution(string s, string skip, int index) {
        string answer = "";
        
        for(int i = 0;i<s.Length;i++)
        {
            int asc = Convert.ToInt32(s[i]);
            
            for(int k = 0;k<index;k++)
            {
                asc++;
                if(asc > 122)
                {
                    asc = asc - 26;
                }
                
                for(int j = 0;j<skip.Length;j++)
                {
                    if(skip.Contains((char)asc))
                    {
                        asc++;
                        if(asc > 122)
                        {
                            asc = asc - 26;
                        }
                    }
                }
            }
        
            answer += (char)asc;
        }
        
        return answer;
    }
}

////////////////

자바

class Solution {
    public String solution(String s, String skip, int index) {
        StringBuilder answer = new StringBuilder();

        for (char letter : s.toCharArray()) 
        {
            char temp = letter;
            int idx = 0;
            
            while (idx < index) 
            {
                temp = temp == 'z' ? 'a' : (char) (temp + 1);
                
                if (!skip.contains(String.valueOf(temp))) 
                {
                    idx += 1;
                }
            }
            answer.append(temp);
        }

        return answer.toString();
    }
}

class Solution {
    public String solution(String s, String skip, int index) {
        String answer = "";

        for (char c : s.toCharArray()) 
        {
            for (int i = index; i > 0; i--) 
            {
                c++;
                if (c > 122) c -= 26;
                while (skip.contains(String.valueOf(c))) 
                {
                    c++;
                    if (c > 122) c -= 26;
                }
            }
            answer += c;
        }
        return answer;
    }
}

https://m.blog.naver.com/gboarder/90015619564