일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |
- Python Implementation
- t1
- 43. Multiply Strings
- LeetCode
- 30. Substring with Concatenation of All Words
- attribute
- Protocol
- 밴픽
- 컴퓨터의 구조
- Python Code
- 운영체제
- 109. Convert Sorted List to Binary Search Tree
- shiba
- Decorator
- concurrency
- 파이썬
- Class
- Python
- 315. Count of Smaller Numbers After Self
- 715. Range Module
- kaggle
- DWG
- data science
- 프로그래머스
- iterator
- Regular Expression
- Substring with Concatenation of All Words
- 시바견
- Convert Sorted List to Binary Search Tree
- Generator
- Today
- Total
목록Computer Science/C++ (31)
Scribbling
LeetCode: 452. Minimum Number of Arrows to Burst Balloons https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/description/?envType=study-plan-v2&envId=top-interview-150 Minimum Number of Arrows to Burst Balloons - LeetCode Can you solve this real interview question? Minimum Number of Arrows to Burst Balloons - There are some spherical balloons taped onto a flat wall that rep..
LeetCode: 373. Find K Pairs with Smallest Sums https://leetcode.com/problems/find-k-pairs-with-smallest-sums/description/?envType=study-plan-v2&envId=top-interview-150 Find K Pairs with Smallest Sums - LeetCode Can you solve this real interview question? Find K Pairs with Smallest Sums - You are given two integer arrays nums1 and nums2 sorted in non-decreasing order and an integer k. Define a pa..
LeetCode: 416. Partition Equal Subset Sum https://leetcode.com/problems/partition-equal-subset-sum/description/ Partition Equal Subset Sum - LeetCode Can you solve this real interview question? Partition Equal Subset Sum - Given an integer array nums, return true if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or false otherwise. Example..
LeetCode: 30. Substring with Concatenation of All Words https://leetcode.com/problems/substring-with-concatenation-of-all-words/description/?envType=study-plan-v2&envId=top-interview-150 Substring with Concatenation of All Words - LeetCode Can you solve this real interview question? Substring with Concatenation of All Words - You are given a string s and an array of strings words. All the string..
LeetCode: 410. Split Array Largest Sum https://leetcode.com/problems/split-array-largest-sum/description/ Split Array Largest Sum - LeetCode Can you solve this real interview question? Split Array Largest Sum - Given an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized. Return the minimized largest sum of the split. ..
LeetCode: 394. Decode String https://leetcode.com/problems/decode-string/description/ Decode String - LeetCode Can you solve this real interview question? Decode String - Given an encoded string, return its decoded string. The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is g leetcode.com class Solution { ..
LeetCode 297. Serialize and Deserialize Binary Tree https://leetcode.com/problems/serialize-and-deserialize-binary-tree/ Serialize and Deserialize Binary Tree - LeetCode Can you solve this real interview question? Serialize and Deserialize Binary Tree - Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffe..
LeetCode 290. Word Pattern https://leetcode.com/problems/word-pattern/ Word Pattern - LeetCode Can you solve this real interview question? Word Pattern - Given a pattern and a string s, find if s follows the same pattern. Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in s. Example leetcode.com class Solution { public: bool wordPat..
1. Function types a) return type: int, arg type: double (function) int func(double) int (double) b) return type: &int[2][3], arg type: double (function) int (*func(double))[2][3] int (*(double))[2][3] c) return type: function pointer of (b), arg type: double (function pointer) int (*(*)(double))[2][3] d) return type: int[2][3], arg type: vector (function) int (std::vector)[2][3] 2. typedef typed..
#include #include #include #include #include #include #include #include #include using namespace std; class Solution { public: int solution(int n, int m, vector& burstTime) { int ret = accumulate(burstTime.begin(), burstTime.end(), 0); int left = *max_element(burstTime.begin(), burstTime.end()); int right = ret; while (left