update leetcode

Author: intfloat

leetcode/ImageSmoother.cpp

@@ -0,0 +1,36 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define FOR(i, n) for (int i = 0; i < (int)n; ++i)
+typedef long long ll;
+typedef pair<int, int> pii;
+
+int dir_x[] = {0, 0, 1, 1, 1, -1, -1, -1};
+int dir_y[] = {1, -1, -1, 0, 1, -1, 0, 1};
+class Solution {
+public:
+ vector<vector<int>> imageSmoother(vector<vector<int>>& M) {
+ vector<vector<int>> res = M;
+ int row = M.size(), col = M[0].size();
+ for (int i = 0; i < row; ++i) {
+ for (int j = 0; j < col; ++j) {
+ int sum = M[i][j];
+ int cnt = 1;
+ for (int d = 0; d < 8; ++d) {
+ int nx = i + dir_x[d];
+ int ny = j + dir_y[d];
+ if (nx >= 0 && nx < row && ny >= 0 && ny < col) {
+ sum += M[nx][ny];
+ ++cnt;
+ }
+ }
+ res[i][j] = sum / cnt;
+ }
+ }
+ return res;
+ }
+};
+
+int main() {
+ Solution solution;
+ return 0;
+}

leetcode/MaximumWidthOfBinaryTree.cpp

@@ -0,0 +1,59 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define FOR(i, n) for (int i = 0; i < (int)n; ++i)
+typedef long long ll;
+typedef pair<int, int> pii;
+
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ * int val;
+ * TreeNode *left;
+ * TreeNode *right;
+ * TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+typedef pair<TreeNode*, ll> pti;
+class Solution {
+public:
+ int widthOfBinaryTree(TreeNode* root) {
+ if (NULL == root) return 0;
+ queue<pti> q;
+ q.push({root, 0LL});
+ int res = 1;
+ while (!q.empty()) {
+ int sz = q.size();
+ int start_idx = -1;
+ ll mn = 1LL<<48, mx = -1;
+ FOR(i, sz) {
+ pti tp = q.front();
+ q.pop();
+ TreeNode* cur = tp.first;
+ ll idx = tp.second;
+ mx = max(idx, mx);
+ mn = min(idx, mn);
+ if (cur->left != NULL) {
+ if (start_idx < 0) {
+ start_idx = idx * 2;
+ }
+ q.push({cur->left, idx * 2 - start_idx});
+ }
+ if (cur ->right != NULL) {
+ if (start_idx < 0) {
+ start_idx = idx * 2 + 1;
+ }
+ q.push({cur->right, idx * 2 + 1 - start_idx});
+ }
+ }
+ res = max(res, (int)(mx - mn + 1));
+ }
+ return res;
+ }
+};
+
+int main() {
+ Solution solution;
+ return 0;
+}

leetcode/NonDecreasingArray.cpp

@@ -0,0 +1,24 @@
+class Solution {
+public:
+ bool checkPossibility(vector<int>& nums) {
+ int sz = nums.size();
+ int mod_cnt = 0;
+ for (int i = 0; i < sz - 1; ++i) {
+ if (nums[i] > nums[i + 1]) {
+ if (mod_cnt >= 1) {
+ return false;
+ }
+ if (i - 1 < 0 || nums[i + 1] >= nums[i - 1]) {
+ ++mod_cnt;
+ nums[i] = nums[i + 1];
+ } else if (i + 2 >= sz || nums[i + 2] >= nums[i]) {
+ ++mod_cnt;
+ nums[i + 1] = nums[i];
+ } else {
+ return false;
+ }
+ }
+ }
+ return true;
+ }
+};