728x90 전체 글162 :: Scope Operator(범위 지정 연산자)를 쓰는 3가지 상황 :: 이 기호는 Scope Operator(범위 지정 연산자)라고 한다. 범위 지정 연산자는 밑의 3가지 경우에서 쓸 수 있다. 1. namespace:: 2. className:: 3. :: namespace:: 어떤 namespace 안에 선언된 함수인지 지정하여 호출할 때 사용한다. namespace nameA{ void A(); } int main() { nameA::A(); } className:: 어떤 class 안에 선언된 멤버 함수인지 지정하여 호출할 때 사용한다. class A{ void a(); } int main() { A::a(); } :: global scope 함수나 변수를 지정하여 호출할 때 사용한다. int g_num; intmain(int argc, char **argv) .. 2022. 2. 15. leetcode 136) Single Number LV. Easy 😎 https://leetcode.com/problems/single-number/ Single Number - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime.. 2022. 2. 15. leetcode 104) Maximum Depth of Binary Tree LV. Easy 😎 https://leetcode.com/problems/maximum-depth-of-binary-tree/ Maximum Depth of Binary Tree - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest.. 2022. 2. 14. leetcode 78) Subsets LV. Medium 🧐 https://leetcode.com/problems/subsets/ Subsets - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Return the solution in .. 2022. 2. 13. leetcode 127) Word Ladder LV. Hard 🥵 https://leetcode.com/problems/word-ladder/ Word Ladder - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that: Ever.. 2022. 2. 12. leetcode 560) Subarray Sum Equals K LV. Medium 🧐 https://leetcode.com/problems/subarray-sum-equals-k/ Subarray Sum Equals K - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 Given an array of integers nums and an integer k, return the total number of continuous subarrays whose sum equals to k. Example 1: Input: nu.. 2022. 2. 11. leetcode 567) Permutation in String LV. Medium 🧐 https://leetcode.com/problems/permutation-in-string/ Permutation in String - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise. In other words, return true if one of s1's p.. 2022. 2. 11. Mac 환경에서 Flutter 설치 Flutter는 IOS와 Android를 한 번에 만들 수 있는 프레임워크(Framework)이다. 한 번에 아이폰(iphone)과 안드로이드(Android)를 모두 개발할 수 있다는 장점을 가졌다. 아래 링크에 들어가 macOS 전용 Flutter SDK를 다운받는다. https://docs.flutter.dev/get-started/install/macos macOS install How to install on macOS. docs.flutter.dev 원하는 위치에 가서 압축을 푼다. unzip ~/Downloads/flutter_macos_2.10.0-stable.zip 압축을 풀고 환경 변수(영구)를 설정해준다. $ cd ~ $ nano .zshrc .zshrc에 밑의 내용 입력 후 저장 $ .. 2022. 2. 9. leetcode 532) K-diff Pairs in an Array LV. Medium 🧐 https://leetcode.com/problems/k-diff-pairs-in-an-array/ K-diff Pairs in an Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 Given an array of integers nums and an integer k, return the number of unique k-diff pairs in the array. A k-diff pair is an integer pa.. 2022. 2. 9. 이전 1 ··· 4 5 6 7 8 9 10 ··· 18 다음 728x90
