꿈꾸는공학도

사실 FILE I/O의 경우엔 코딩 공부를 할 때 잘 까먹기 쉽다. 왜냐하면, file I/O 할 때가 아니면 평소에 쓸 일이 없는 문법이 많기 때문이다. 그래서 종종 Remind 차원에서 file I/O를 건드려줘야 기억에 오래 남는다. 물론 그 때 그 때 인터넷 검색해서 실행해도 충분히 코딩을 할 수 있지만, 그래도 명색이 프로그래밍 공부를 하는 사람이라면 이 정도는 능숙하게 처리할 수 있어야 멋지다. 첨부된 파일에선 여러 가지 scanf + file I/O 연습을 할 수 있다. 주석처리한 부분은 나만의 낙서장(?)으로 사용된 것이라 삭제하고 코딩을 진행하면 된다. Q1.scanf 연습하는 문제다.12-hour 시간을 user로부터 입력받아 24-hour 시간으로 return해주는 코드를 짜는 것! ..

https://leetcode.com/problems/partition-list/description/Given the head of a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of the two partitions. Example 1:Input: head = [1,4,3,2,5,2], x = 3Output: [1,2,2,4,3,5]Example 2:Input: head = [2,1], x = 2Output: [1,..

https://leetcode.com/problems/powx-n/description/Implement pow(x, n), which calculates x raised to the power n (i.e., xn). Example 1:Input: x = 2.00000, n = 10Output: 1024.00000Example 2:Input: x = 2.10000, n = 3Output: 9.26100Example 3:Input: x = 2.00000, n = -2Output: 0.25000Explanation: 2-2 = 1/22 = 1/4 = 0.25 Constraints:-100.0 -231 n is an integer.Either x is not zero or n > 0.-104 일단 첫 인상은..

https://leetcode.com/problems/rotate-list/description/Given the head of a linked list, rotate the list to the right by k places. Example 1:Input: head = [1,2,3,4,5], k = 2Output: [4,5,1,2,3]Example 2:Input: head = [0,1,2], k = 4Output: [2,0,1] Constraints:The number of nodes in the list is in the range [0, 500].-100 0 1. C또 Naive하게 했다가 얻어 맞은 Time Limit ㅠㅠC는 빠른 언어라 상관 없을 줄 알았는데 얄짤 없네/** * Definit..

https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/You are given an integer array prices where prices[i] is the price of a given stock on the ith day.On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immediately sell it on the same day.Find and return the maximum profit yo..

https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/You are given an array prices where prices[i] is the price of a given stock on the ith day.You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.Return the maximum profit you can achieve from this transaction. If you cannot achieve any profi..

https://leetcode.com/problems/climbing-stairs/description/You are climbing a staircase. It takes n steps to reach the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example 1:Input: n = 2Output: 2Explanation: There are two ways to climb to the top.1. 1 step + 1 step2. 2 stepsExample 2:Input: n = 3Output: 3Explanation: There are three ways to ..

You are given m arrays, where each array is sorted in ascending order.You can pick up two integers from two different arrays (each array picks one) and calculate the distance. We define the distance between two integers a and b to be their absolute difference |a - b|.Return the maximum distance. Example 1:Input: arrays = [[1,2,3],[4,5],[1,2,3]]Output: 4Explanation: One way to reach the maximum d..

https://leetcode.com/problems/remove-duplicates-from-sorted-list/description/Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well. Example 1:Input: head = [1,1,2]Output: [1,2]Example 2:Input: head = [1,1,2,3,3]Output: [1,2,3] Constraints:The number of nodes in the list is in the range [0, 300].-100 The list ..

https://leetcode.com/problems/find-k-th-smallest-pair-distance/description/?envType=daily-question&envId=2024-08-14The distance of a pair of integers a and b is defined as the absolute difference between a and b.Given an integer array nums and an integer k, return the kth smallest distance among all the pairs nums[i] and nums[j] where 0  Example 1:Input: nums = [1,3,1], k = 1Output: 0Explanation..