#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - 연산자는 덧셈, 뺄셈, 곱셈, 나눗셈 - 수열의 순서는 유지한 채 각 항사이에 N-1개의 연산자를 적절히 배치 - 연산자 우선순위를 따지지 않고 맨 앞쪽 연산자부터 차례로 계산 - 연산 결과가 최대인 것과 최소인 것을 출력 3. Create solution plan (select Algorithm, Data structure) ..
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - N일동안 최대한 많은 상담 - 최대 이익이 나는 스케쥴 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back..
[Inflearn] 순열구하기(DFS : Depth First Search)
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - 자연수 N과 R이 주어지면, 서로 다른 N개의 자연수 중 R개를 뽑아 일렬로 나열 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the pl..
[Inflearn] 친구인가? (Union & Find 자료구조)(c/c++)
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to im..
[Inflearn] 이항계수(메모이제이션)(c/c++)
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to im..
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - D일 안에 와서 강연을 해 주면 M 만큼의 강연료 - D와 M을 바탕으로 가장 많이 돈을 벌 수 있도록 스케쥴을 짜야 함 - 강연은 하루에 하나의 강연 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance tim..
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - 3을 외친 왕자가 제외 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and f..
[Inflearn] 송아지 찾기(BFS : 상태트리탐색)
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - 직선상의 좌표 - 앞으로 1, 뒤로 1, 앞으로 5 이동 가능 - 최소 몇 번의 점프로 송아지의 위치까지 갈 수 있는가 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory..