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

자바

import java.util.*;

public class Main{

public static void main(String args[]){

  Scanner sc = new Scanner(System.in);

  int a, b, i, j, k;

  a = sc.nextInt();

  b = sc.nextInt();

  int basket[] = new int[a];

    for(int p = 0;p<b;p++)
    {

        i = sc.nextInt();

        j = sc.nextInt();

        k = sc.nextInt();

        for(int n = i-1;n<j;n++)
        {

            basket[n] = k;

        }

    }

    for(int n = 0;n<a;n++)
    {

        System.out.print(basket[n] + " ");

    }
}
}

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

C#

using System;

namespace Baekjoon {
    class Program {
        static void Main() {
            string s = Console.ReadLine();
            string[] ss = s.Split(' ');
            int i, j, k;
            int a = int.Parse(ss[0]);
            int b = int.Parse(ss[1]);
            int[] basket = new int[a];
            
        for(int p = 0;p<b;p++)
        {
            string bask = Console.ReadLine();
            string[] bask2 = bask.Split(' ');
            i = int.Parse(bask2[0]);
            j = int.Parse(bask2[1]);
            k = int.Parse(bask2[2]);

        for(int n = i-1;n<j;n++)
        {
            basket[n] = k;
        }
    }

    for(int n = 0;n<a;n++)
    {
        Console.Write(basket[n] + " ");
    }
        }
    }
}

자바

import java.util.*;

public class Main{
public static void main(String args[]){

  Scanner sc = new Scanner(System.in);
  int a;

  a = sc.nextInt();

for(int i = 0;i<a/4;i++)
    {

        System.out.print("long ");

    }

System.out.print("int");

}
}

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

C#

using System;

namespace ConsoleApp1
{
    class Program
    {
        static void Main(string[] args)
        {
            string s = Console.ReadLine();
            int a = int.Parse(s);
            
            for(int i = 0;i<a/4;i++)
            {
                Console.Write("long ");
            }
            Console.Write("int");
        }
    }
}

C#

using System;

namespace Baekjoon {
    class Program {
        static void Main() {
            string s = Console.ReadLine();
            string[] ss = s.Split(' ');

            long a = long.Parse(ss[0]);
            long b = long.Parse(ss[1]);
            long c = long.Parse(ss[2]);
            Console.WriteLine(a + b + c);
        }
    }
}

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

자바

import java.util.*;
public class Main{
public static void main(String args[]){
  Scanner sc = new Scanner(System.in);
  long a, b,c;

  a = sc.nextLong();
  b = sc.nextLong();
    c = sc.nextLong();
  System.out.println(a + b + c);
}
}

C#

using System;

using System.Collections.Generic;

public class Solution {
   public int solution(int x, int y, int n)
        {
            int answer = 0;
            int value = 0;
            int tempValue = 0;
            Queue<int> currentValuesQu = new Queue<int>();
            bool[] visited = new bool[y + 1];

            if (x == y)
                return 0;

            currentValuesQu.Enqueue(x);
       
            while (currentValuesQu.Count != 0)
            {
                int size = currentValuesQu.Count;
                for (int iPos = 0; iPos < size; iPos++)
                {
                    value = currentValuesQu.Dequeue();

                    tempValue = value * 3;
                    if (tempValue <= y && visited[tempValue] == false)
                    {
                        currentValuesQu.Enqueue(tempValue);
                        visited[tempValue] = true;
                    }

                    tempValue = value * 2;
                    if (tempValue <= y && visited[tempValue] == false)
                    {
                        currentValuesQu.Enqueue(tempValue);
                        visited[tempValue] = true;
                    }

                    tempValue = value + n;
                    if (tempValue <= y && visited[tempValue] == false)
                    {
                        currentValuesQu.Enqueue(tempValue);
                        visited[tempValue] = true;
                    }
                }

                answer++;
                if (currentValuesQu.Contains(y))
                    return answer;
            }
            return -1;
        }
}

C#

using System;
using System.Collections.Generic;
using System.Linq;

public class Solution {
    public int solution(int[] priorities, int location)
    {
        int answer = 0;
        Queue<KeyValuePair<int, int>> que = new Queue<KeyValuePair<int, int>>();
        
        for(int i = 0; i < priorities.Length; i++)
        {
            que.Enqueue(new KeyValuePair<int, int>(i, priorities[i]));
        }
        
        while(true)
        {
            int Max = que.Max(x=>x.Value);
            var deque = que.Dequeue();

            if (deque.Value == Max)
            {
                if (deque.Key == location) return answer + 1;
                else
                {
                    answer++;
                    continue;
                }
            }
            que.Enqueue(deque);
        }
    }
}

// Enqueue가 push 같은 느낌이고

// Dequeue가 pop 같은 느낌이다.

// 큐는 FIFO 처음에 들어간 게 처음에 나간다는 개념이다.

using System;
using System.Collections.Generic;
using System.Linq;

public class Solution {
    public int solution(int[] priorities, int location) {
        int answer = 0;
            Queue<int> que = new Queue<int>(Enumerable.Range(0, priorities.Length));
            List<int> max = new List<int>(priorities);

            while (que.Count > 0) 
            {
                int document = que.Dequeue();

                if (max.Max() <= priorities[document])
                {
                    answer++;
                    max.Remove(priorities[document]);

                    if (document == location)
                        break;
                }
                else
                    que.Enqueue(document);
            }

            return answer;
    }
}

자바

import java.util.*;

class Solution {
    int[][] map;
    List<Integer> answer = new LinkedList<>();
    public int[] solution(String[] maps) {
        
        map = new int[maps.length][maps[0].length()];
        // 2차원 배열로 정의
        for(int i = 0;i<maps.length;i++)
        {
            char[] mapCharArr = maps[i].toCharArray();
            
            for(int j = 0;j<mapCharArr.length;j++)
            {
                char c = mapCharArr[j];
                
                if(c == 'X' || c == 'x')
                {
                    //X표시면 -1리턴한다
                    map[i][j] = -1;
                }
                else
                {

                    // 문자열 c의 숫자에 문자열 0(아스키코드 48)을 빼준다. 예를 들어 1이면 49 - 48 = 1이 댄다.
                    map[i][j] = c - '0';
                }
            }    
        }
        
        for(int i = 0;i<map.length;i++)
        {
            for(int j = 0;j<map[0].length;j++)
            {
                int islandSum = dfs(i,j);
                if(islandSum > 0)
                {
                    answer.add(islandSum);
                    // 무인도 값 합치기
                }
            }
        }
        
        if(answer.size() == 0) return new int[] {-1};
        // 사이즈가 0, 전부 X면 -1 배열리턴
        Collections.sort(answer);
        // 값이 작은 것부터 나오게 출력
        int[] answerArr = new int[answer.size()];
        
        for(int i = 0;i<answerArr.length;i++) answerArr[i] = answer.get(i);
        // 배열에 집어넣기
        return answerArr;
    }
    
    public int dfs(int i, int j)
    {
        if(i<0 || j<0 || i>=map.length || j>=map[0].length) return 0;
        // 범위를 벗어나면 0리턴
        if(map[i][j] == -1) return 0;
        // 이미 탐색했거나 X표시면 0을 리턴
        int tmp = map[i][j];
        map[i][j] = -1;
        // 탐색했다.
        return tmp + dfs(i-1, j) + dfs(i+1, j) + dfs(i, j-1) + dfs(i, j+1);
        // 주변 무인도 값 탐색하기
    }
}

/// 리스트를 만들어서 add 해주고 X표시는 -1로 해서 if문으로 0보다 큰 거만 수집할 수 있게 한 뒤에 dfs를 활용한다.

C#

using System;
using System.Collections.Generic;

public class Solution {
    public int solution(string s) {
        int answer = 0;
        int sameIndex = 0;
        int diffIndex = 0;
        char word = ' ';
        bool start = true; 
        
        for(int i = 0; i < s.Length; i++)
        {
            if(start == true)
            {
                word = s[i];
                sameIndex++;
                start = false;
                // 첫 번째 글자
            }
            else
            {
                if(s[i] == word)
                {
                    sameIndex++;
                }
                else
                {
                    diffIndex++;
                }
                // 첫 번째 글자 word랑 같으면 same을 플러스하고 아니면 다른 인덱스 플러스
            }
            
            if(sameIndex == diffIndex)
            {
                answer++;
                sameIndex = 0;
                diffIndex = 0;
                start = true;
                /// 첫 글자와 같은 문자의 수 = 다른 문자의 수이면 
                /// 자른 후에 초기화 하기
            }
            
            if(i == s.Length - 1)
            {
                if(start == false)
                {
                    answer++;
                }
            }
            /// 마지막 글자에 +1을 해준다.
        }
        return answer;
    }
}

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

using System;

public class Solution {
    public int solution(string s) {
        int answer = 0;

        if (s == string.Empty)
                return answer;

            char frist = s[0];

            int sameCount = 0;
            int diffCount = 0;

            for (int i = 0; i < s.Length; ++i)
            {
                if(sameCount == 0)
                    frist = s[i];

                if (frist == s[i])
                    sameCount++;
                else
                    diffCount++;

                if (sameCount == diffCount)
                {
                    answer++;

                    sameCount = 0;
                    diffCount = 0;
                }
                else
                {
                    if(i + 1 >= s.Length)
                        answer++;
                }
            }


        return answer;
    }
}

자바

public class Solution {
    public int solution(String s) {
        int answer = 0;
        char init = s.charAt(0);
        int count = 0;
        for (char c : s.toCharArray()) 
        {
            if (count == 0) 
            {
                init = c;
            }
            if (init == c) 
            {
                count++;
            } 
            else 
            {
                count--;
            }
            
            if (count == 0) 
            {
                answer++;
            }
        }

        if(count > 0) 
        {
            answer++;
        }
        return answer;
    }
}