월간 보관물: 2020 11월
[ICT 기본지식] NIC 이란 무엇인가?
본 포스팅에서는 NIC 이란 무엇인지 알아보도록 하겠습니다. 시작에 앞서, 만약 네트워크 스위치, 라우터에 대해 모르신다면 아래 글을 먼저 읽어보시길 추천 드립니다. 링크 : ‘네트워크, 라우터, 스위치’ 이제 이글을 읽어나가는 여러분은 컴퓨터가 왜 통신이 되는지 기존부터 알고 있었거나, 이해하고 오셨을 것입니다. … 계속 읽기
[Linux] CentOS, RHEL NAS 마운트 하기
본 포스팅에서는 CentOS or RHEL 에서 NAS 로 마운트하는 방법을 소개하겠습니다. 관련 패키지 설치yum install nfs-utils NAS 마운트 하기mount -t nfs <NAS_IP>:/<NAS_Export_경로> /<Local_마운트경로> /etc/fstab 등록 (부팅 시, 자동 마운트)아래 line을 /etc/fstab 에 추가합니다.<NAS_IP>:/<NAS_Export_경로> /<Local_마운트경로> nfs defaults 0 0
[LeetCode] 19 – Remove Nth Node From End of List
problem : https://leetcode.com/problems/remove-nth-node-from-end-of-list/ Given the head of a linked list, remove the nth node from the end of the list and return its head. Follow up: Could you do this in one pass? Example 1: Input: head = [1,2,3,4,5], n = 2 Output: [1,2,3,5] Example … 계속 읽기
[LeetCode] 42 – Trapping Rain Water
problem : https://leetcode.com/problems/trapping-rain-water/ Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Example 1: Input: height = [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6 Explanation: The above elevation map (black section) … 계속 읽기
[LeetCode] 22 – Generate Parentheses
problem : https://leetcode.com/problems/generate-parentheses/ Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example 1: Input: n = 3 Output: [“((()))”,”(()())”,”(())()”,”()(())”,”()()()”] Example 2: Input: n = 1 Output: [“()”] Constraints: 1 <= n <= 8 C++ Code
[LeetCode] 16 – 3Sum Closest
problem : https://leetcode.com/problems/3sum-closest/ Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution. Example 1: Input: … 계속 읽기
[LeetCode] 11 – Container With Most Water
problem : https://leetcode.com/problems/container-with-most-water/ Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a … 계속 읽기
Developer Lee 