본문 바로가기

분류 전체보기61

React에서 .env 환경변수 사용하기 1. root 에 .env 파일 생성 2. .gitignore 파일에 .env 추가 .gitignore 파일에 .env파일을 추가해줘야지 깃허브에 올라가지 않는다. 3. 변수 생성 아래 사진과 같이 key=value 값으로 변수 생성 (REACT_APP_ 반드시 key앞에 붙여줘야한다) 추가 주의사항으로 value 끝에 , 또는 ; 를 붙여 주면 안 된다. 4. 변수 사용 사용하려는 key 앞에 process.env.REACT_APP_ 을 붙여주어 사용한다. 이 부분에서 실수하여 계속 undefined 값을 받았는데 꼭!!! process.env 뒤에 REACT_APP_ 을 붙여 줘야 합니다. 참고 자료 https://stackoverflow.com/a/53237511/14071328 2022. 6. 10.
LeetCode - Weekly Contest 296 풀이 및 후기 2293. Min Max Game 난이도: Easy You are given a 0-indexed integer array nums whose length is a power of 2. Apply the following algorithm on nums: Let n be the length of nums. If n == 1, end the process. Otherwise, create a new 0-indexed integer array newNums of length n / 2. For every even index i where 0 2022. 6. 5.
51. N-Queens - 데일리 문제 51. N-Queens 난이도: Hard The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, return all distinct solutions to the n-queens puzzle. You may return the answer in any order. Each solution contains a distinct board configuration of the n-queens' placement, where 'Q' and '.' both indicate a queen and an empty space.. 2022. 6. 5.
304. Range Sum Query 2D - Immutable - 데일리 문제 304. Range Sum Query 2D - Immutable 난이도: Medium Given a 2D matrix matrix, handle multiple queries of the following type: Calculate the sum of the elements of matrix inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2). Implement the NumMatrix class: NumMatrix(int[][] matrix) Initializes the object with the integer matrix matrix. int sumRegion(int.. 2022. 6. 3.
867. Transpose Matrix - 데일리 문제 867. Transpose Matrix 난이도: Easy Given a 2D integer array matrix, return the transpose of matrix. The transpose of a matrix is the matrix flipped over its main diagonal, switching the matrix's row and column indices. Example 1: Input: matrix = [[1,2,3],[4,5,6],[7,8,9]] Output: [[1,4,7],[2,5,8],[3,6,9]] Example 2: Input: matrix = [[1,2,3],[4,5,6]] Output: [[1,4],[2,5],[3,6]] Constraints: m == matr.. 2022. 6. 2.
1461. Check If a String Contains All Binary Codes of Size K 문제 풀이 1461. Check If a String Contains All Binary Codes of Size K 난이도: Medium Given a binary string s and an integer k, return true if every binary code of length k is a substring of s. Otherwise, return false. Example 1: Input: s = "00110110", k = 2 Output: true Explanation: The binary codes of length 2 are "00", "01", "10" and "11". They can be all found as substrings at indices 0, 1, 3 and 2 respec.. 2022. 5. 31.
LeetCode - Biweekly Contest 79 LeetCode - Biweekly Contest 79 2283. Check if Number Has Equal Digit Count and Digit Value 난이도 : Easy You are given a 0-indexed string num of length n consisting of digits. Return true if for every index i in the range 0 2022. 5. 29.

티스토리툴바