leetcodeSolution to some Leetcode problems written in C++ |
| git clone git://git.dimitrijedobrota.com/leetcode.git |
| Log | Files | Refs | README | LICENSE | |
| commit | 7bffd2324dabd44143ba0d6bdc94ab34d27a6094 |
| parent | ff69f22747db5464711d5a3e8f8184a9fbe189c4 |
| author | Dimitrije Dobrota <mail@dimitrijedobrota.com> |
| date | Fri, 25 Aug 2023 11:06:17 +0200 |
Daily Problem and 5 Random Problems
Diffstat:| A | Problems/0097.cpp | | | +++++++++++++++++++++++ |
| A | Problems/0406.cpp | | | ++++++++++++ |
| A | Problems/0442.cpp | | | +++++++++++++++ |
| A | Problems/1286.cpp | | | ++++++++++++++++++++++++++++ |
| A | Problems/1415.cpp | | | ++++++++++++++++++++++++++ |
| A | Problems/2294.cpp | | | ++++++++++++ |
| M | README.md | | | ++++++ |
7 files changed, 122 insertions(+), 0 deletions(-)
diff --git a/Problems/0097.cpp b/Problems/0097.cpp
@@ -0,0 +1,23 @@
class Solution {
short int dp[101][101];
bool rec(const string &s1, const string &s2, const string &s3, int i = 0,
int j = 0, int k = 0) {
if (k == s3.size()) return true;
if (dp[i][j] != -1) return dp[i][j];
if (i != s1.size() && s1[i] == s3[k] && rec(s1, s2, s3, i + 1, j, k + 1))
return dp[i][j] = true;
if (j != s2.size() && s2[j] == s3[k] && rec(s1, s2, s3, i, j + 1, k + 1))
return dp[i][j] = true;
return dp[i][j] = false;
}
public:
Solution() { memset(dp, 0xFF, sizeof(dp)); }
bool isInterleave(const string &s1, const string &s2, const string &s3) {
if (s1.size() + s2.size() != s3.size()) return false;
return rec(s1, s2, s3);
}
};
diff --git a/Problems/0406.cpp b/Problems/0406.cpp
@@ -0,0 +1,12 @@
class Solution {
public:
vector<vector<int>> reconstructQueue(vector<vector<int>> &people) {
sort(begin(people), end(people), [](const auto &a, const auto &b) {
return a[0] > b[0] || (a[0] == b[0] && a[1] < b[1]);
});
vector<vector<int>> res;
res.reserve(people.size());
for (const auto &p : people) res.insert(res.begin() + p[1], p);
return res;
}
};
diff --git a/Problems/0442.cpp b/Problems/0442.cpp
@@ -0,0 +1,15 @@
class Solution {
public:
vector<int> findDuplicates(vector<int> &nums) {
vector<int> res;
for (int i = 0; i < nums.size(); i++) {
int idx = abs(nums[i]) - 1;
if (nums[idx] < 0)
res.push_back(idx + 1);
else
nums[idx] = -nums[idx];
}
return res;
}
};
diff --git a/Problems/1286.cpp b/Problems/1286.cpp
@@ -0,0 +1,28 @@
class Solution {
vector<int> vec;
const string chars;
string res;
bool has_next = true;
void shuffle() {
int goal = chars.size() - 1, idx = vec.size() - 1;
while (idx > 0 && vec[idx] == goal) goal--, idx--;
for (int i = idx, acc = vec[idx]; i < vec.size(); i++)
res[i] = chars[vec[i] = ++acc];
if (idx == 0 && vec[0] == goal) has_next = false;
}
public:
CombinationIterator(string chars, int len)
: chars(chars), vec(len), res(len, ' ') {
for (int i = 0; i < len; i++) res[i] = chars[vec[i] = i];
vec.back()--;
}
string next() {
shuffle();
return res;
}
bool hasNext() { return has_next; }
};
diff --git a/Problems/1415.cpp b/Problems/1415.cpp
@@ -0,0 +1,26 @@
class Solution {
vector<string> res;
string crnt;
void rec(int n, int k, char last = 'x') {
if (res.size() == k) return;
if (crnt.size() == n) {
res.push_back(crnt);
return;
}
crnt.push_back(' ');
for (char c = 'a'; c <= 'c'; c++) {
if (c == last) continue;
crnt.back() = c;
rec(n, k, c);
}
crnt.pop_back();
}
public:
string getHappyString(int n, int k) {
if (k > 3 * (1 << n - 1)) return "";
rec(n, k);
return res.back();
}
};
diff --git a/Problems/2294.cpp b/Problems/2294.cpp
@@ -0,0 +1,12 @@
class Solution {
public:
int partitionArray(vector<int> &nums, int k) {
sort(begin(nums), end(nums));
int res = 1, j = 0;
for (int i = 1; i < nums.size(); i++) {
if (nums[i] - nums[j] > k) j = i, res++;
}
return res;
}
};
diff --git a/README.md b/README.md
@@ -113,6 +113,7 @@ for solving problems.
| 0094 | Easy | [Binary Tree Inorder Traversal](Problems/0094.cpp) |
| 0095 | Medium | [Unique Binary Search Trees II](Problems/0095.cpp) |
| 0096 | Medium | [Unique Binary Search Trees](Problems/0096.cpp) |
| 0097 | Medium | [Interleaving String](Problems/0097.cpp) |
| 0098 | Medium | [Validate Binary Search Tree](Problems/0098.cpp) |
| 0099 | Medium | [Recover Binary Search Tree](Problems/0099.cpp) |
| 0100 | Easy | [Same Tree](Problems/0100.cpp) |
@@ -266,6 +267,7 @@ for solving problems.
| 0399 | Medium | [Evaluate Division](Problems/0399.cpp) |
| 0402 | Medium | [Remove K Digits](Problems/0402.cpp) |
| 0404 | Easy | [Sum of Left Leaves](Problems/0404.cpp) |
| 0406 | Medium | [Queue Reconstruction by Height](Problems/0406.cpp) |
| 0409 | Easy | [Longest Palindrome](Problems/0409.cpp) |
| 0412 | Easy | [Fizz Buzz](Problems/0412.cpp) |
| 0413 | Medium | [Arithmetic Slices](Problems/0413.cpp) |
@@ -282,6 +284,7 @@ for solving problems.
| 0435 | Medium | [Non-overlapping Intervals](Problems/0435.cpp) |
| 0437 | Medium | [Path Sum III](Problems/0437.cpp) |
| 0438 | Medium | [Find All Anagrams in a String](Problems/0438.cpp) |
| 0442 | Medium | [Find All Duplicates in an Array](Problems/0442.cpp) |
| 0443 | Medium | [String Compression](Problems/0443.cpp) |
| 0445 | Medium | [Add Two Numbers II](Problems/0445.cpp) |
| 0448 | Easy | [Find All Numbers Disappeared in an Array](Problems/0448.cpp) |
@@ -473,6 +476,7 @@ for solving problems.
| 1261 | Medium | [Find Elements in a Contaminated Binary Tree](Problems/1261.cpp) |
| 1277 | Medium | [Count Square Submatrices with All Ones](Problems/1277.cpp) |
| 1282 | Medium | [Group the People Given the Group Size They Belong To](Problems/1282.cpp) |
| 1286 | Medium | [Iterator for Combination](Problems/1286.cpp) |
| 1290 | Easy | [Convert Binary Number in a Linked List to Integer](Problems/1290.cpp) |
| 1302 | Medium | [Deepest Leaves Sum](Problems/1302.cpp) |
| 1305 | Medium | [All Elements in Two Binary Search Trees](Problems/1305.cpp) |
@@ -505,6 +509,7 @@ for solving problems.
| 1402 | Hard | [Reducing Dishes](Problems/1402.cpp) |
| 1406 | Hard | [Stone Game III](Problems/1406.cpp) |
| 1409 | Medium | [Queries on a Permutation With Key](Problems/1409.cpp) |
| 1415 | Medium | [The k-th Lexicographical String of All Happy Strings of Length n](Problems/1415.cpp) |
| 1416 | Hard | [Restore The Array](Problems/1416.cpp) |
| 1418 | Medium | [Display Table of Food Orders in a Restaurant](Problems/1418.cpp) |
| 1425 | Hard | [Constrained Subsequence Sum](Problems/1425.cpp) |
@@ -625,6 +630,7 @@ for solving problems.
| 2272 | Hard | [Substring With Largest Variance](Problems/2272.cpp) |
| 2279 | Medium | [Maximum Bags With Full Capacity of Rocks](Problems/2279.cpp) |
| 2285 | Medium | [Maximum Total Importance of Roads](Problems/2285.cpp) |
| 2294 | Medium | [Partition Array Such That Maximum Difference Is K](Problems/2294.cpp) |
| 2300 | Medium | [Successful Pairs of Spells and Potions](Problems/2300.cpp) |
| 2305 | Medium | [Fair Distribution of Cookies](Problems/2305.cpp) |
| 2306 | Hard | [Naming a Company](Problems/2306.cpp) |