전체 글 (2344) 썸네일형 리스트형 (C++) - LeetCode (easy) 744. Find Smallest Letter Greater Than Target https://leetcode.com/problems/find-smallest-letter-greater-than-target/description/ Find Smallest Letter Greater Than Target - LeetCode Can you solve this real interview question? Find Smallest Letter Greater Than Target - You are given an array of characters letters that is sorted in non-decreasing order, and a character target. There are at least two different characters in letters. Retu leetc.. (C++) - LeetCode (easy) 733. Flood Fill https://leetcode.com/problems/flood-fill/description/ Flood Fill - LeetCode Can you solve this real interview question? Flood Fill - An image is represented by an m x n integer grid image where image[i][j] represents the pixel value of the image. You are also given three integers sr, sc, and color. You should perform a flood fill leetcode.com graph 탐색 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 4방향을 확인할 일차원 배열 dr.. (C++) - LeetCode (easy) 728. Self Dividing Numbers.cpp https://leetcode.com/problems/self-dividing-numbers/description/ 📕 풀이방법 📔 입력 및 초기화 정답변수 ans를 선언해줍니다. 📔 풀이과정 1.left ~ right까지 for loop를 수행합니다. 2. 현재 원소를 문자열로 변환해 각 digit에 대해 for loop를 수행합니다. 3. 0이거나 나누어떨어지지 않는다면 loop를 탈출해줍니다. 📕 Code 📔 C++ class Solution { public: vector selfDividingNumbers(int left, int right) { vector ans; for(int i = left; i (C++) - LeetCode (easy) 724. Find Pivot Index https://leetcode.com/problems/find-pivot-index/description/ Find Pivot Index - LeetCode Can you solve this real interview question? Find Pivot Index - Given an array of integers nums, calculate the pivot index of this array. The pivot index is the index where the sum of all the numbers strictly to the left of the index is equal to the sum of leetcode.com 누적합을 이용하는 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 누적합을 .. (C++) - LeetCode (easy) 717. 1-bit and 2-bit Characters https://leetcode.com/problems/1-bit-and-2-bit-characters/description/ 1-bit and 2-bit Characters - LeetCode Can you solve this real interview question? 1-bit and 2-bit Characters - We have two special characters: * The first character can be represented by one bit 0. * The second character can be represented by two bits (10 or 11). Given a binary array bits that leetcode.com 규칙을 찾아 구현하는 문제였습니다. .. (Tibero7) - schema 생성 후 grant 부여하기 🍳머리말 schema를 생성해보는 예제입니다. {}로 감싼 부분은 직접 입력해야합니다. 📕 Prerequisite 📔 tibero7 client 📕설명 📔 client 접속 sys/tibero로 접속합니다. tbsql2 sys/tibero 📔 schema 생성 CREATE USER {schema명} IDENTIFIED BY {사용할 비밀번호}; 📔 권한 부여 db 연결 권한인 CONNECT와 table 및 procedure 등의 개체를 만들 수 있는 권한인 RESOURCE를 부여해줍니다. GRANT CONNECT, RESOURCE TO {만든 schema명}; 📔 결과 grant는 예약어이므로 큰 따옴표로 감싸 만들어줍니다. *더 나은 내용을 위한 지적, 조언은 언제나 환영합니다. (C++) - LeetCode (easy) 709. To Lower Case https://leetcode.com/problems/to-lower-case/description/ (JAVA) - JCE 암호화 복호화 찍먹하기 🍳머리말 Java Cryptography Extension (JCE) 표준 library를 이용해 secret key를 발급받는 예제 code입니다. 📕설명 📔 secret key 생성 📑 code import javax.crypto.KeyGenerator; import javax.crypto.SecretKey; import java.util.Base64; public class SecretKeyExample { public static void main(String[] args) throws Exception { // Create a KeyGenerator KeyGenerator keyGen = KeyGenerator.getInstance("AES"); // Initialize the KeyGenera.. 이전 1 ··· 70 71 72 73 74 75 76 ··· 293 다음
