전체 글 (2344) 썸네일형 리스트형 (C++, Rust) - LeetCode (easy) 933. Number of Recent Calls https://leetcode.com/problems/number-of-recent-calls/description/ Number of Recent Calls - LeetCode Can you solve this real interview question? Number of Recent Calls - You have a RecentCounter class which counts the number of recent requests within a certain time frame. Implement the RecentCounter class: * RecentCounter() Initializes the counter with ze leetcode.com 자료구조를 이용하거나 이분탐색을 사용해본 문제였습니.. (C++) - LeetCode (easy) 929. Unique Email Addresses https://leetcode.com/problems/unique-email-addresses/description/ (C++, Rust) - LeetCode (easy) 925. Long Pressed Name https://leetcode.com/problems/long-pressed-name/description/ Long Pressed Name - LeetCode Can you solve this real interview question? Long Pressed Name - Your friend is typing his name into a keyboard. Sometimes, when typing a character c, the key might get long pressed, and the character will be typed 1 or more times. You examine the typed cha leetcode.com 문자열을 다뤄보는 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 * .. (C++, Rust) - LeetCode (easy) 922. Sort Array By Parity II https://leetcode.com/problems/sort-array-by-parity-ii/description/ Sort Array By Parity II - LeetCode Can you solve this real interview question? Sort Array By Parity II - Given an array of integers nums, half of the integers in nums are odd, and the other half are even. Sort the array so that whenever nums[i] is odd, i is odd, and whenever nums[i] is even leetcode.com 구현 문제였습니다. 📕 풀이방법 📔 입력 및 초.. (C++, Rust) - LeetCode (easy) 917. Reverse Only Letters https://leetcode.com/problems/reverse-only-letters/description/ Reverse Only Letters - LeetCode Can you solve this real interview question? Reverse Only Letters - Given a string s, reverse the string according to the following rules: * All the characters that are not English letters remain in the same position. * All the English letters (lowercase or leetcode.com 문자열을 다루는 문제였습니다. 📕 풀이방법 📔 풀이과정 s.. (C++, Rust) - LeetCode (easy) 914. X of a Kind in a Deck of Cards https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/description/ X of a Kind in a Deck of Cards - LeetCode Can you solve this real interview question? X of a Kind in a Deck of Cards - You are given an integer array deck where deck[i] represents the number written on the ith card. Partition the cards into one or more groups such that: * Each group has exactly x leetcode.com 최대공약수를 이용한 문제.. (C++, Rust) - LeetCode (easy) 908. Smallest Range I https://leetcode.com/problems/smallest-range-i/description/ Smallest Range I - LeetCode Can you solve this real interview question? Smallest Range I - You are given an integer array nums and an integer k. In one operation, you can choose any index i where 0 (Tibero7) - CLOB column 생성, 삭제, 갱신해보기 🍳머리말 Tibero 7에서 CLOB column을 다뤄보는 예제 설명글입니다. 📕 설명 📔 Table 생성 CREATE TABLE TEST (ID integer); 📔 dummy data 삽입 INSERT INTO a values(1); INSERT INTO a values(2); INSERT INTO a values(3); 확인 SELECT * FROM TEST; -- 정보 insert됨을 확인 📔 column 생성 PROPS라는 열을 생성합니다. ALTER TABLE TEST ADD PROPS CLOB; -- props라는 COLUMN 추가. DATA TYPE은 clob SELECT * FROM TEST; -- 정보 insert됨을 확인 📔 column 갱신 ID 1인 부분의 PROPS column.. 이전 1 ··· 65 66 67 68 69 70 71 ··· 293 다음
