Update: 2020/04/10

Author: SunYufei

LeetCode/C/198-dynamic-programming-打家劫舍.cpp

@@ -0,0 +1,28 @@
+/*
+ * @lc app=leetcode.cn id=198 lang=cpp
+ *
+ * [198] 打家劫舍
+ */
+#include "main.h"
+
+// @lc code=start
+class Solution {
+  public:
+    int rob(vector<int> &nums) {
+        int n = nums.size();
+        if (n == 0)
+            return 0;
+        if (n == 1)
+            return nums[0];
+        vector<int> dp(n, 0);
+        dp[0] = nums[0];
+        dp[1] = max(nums[0], nums[1]);
+        int res = dp[1];
+        for (int i = 2; i < n; i++) {
+            dp[i] = max(dp[i - 1], dp[i - 2] + nums[i]);
+            res = max(res, dp[i]);
+        }
+        return res;
+    }
+};
+// @lc code=end

LeetCode/C/238-array-除自身以外数组的乘积.cpp

@@ -0,0 +1,26 @@
+/*
+ * @lc app=leetcode.cn id=238 lang=cpp
+ *
+ * [238] 除自身以外数组的乘积
+ */
+#include "main.h"
+
+// @lc code=start
+class Solution {
+  public:
+    vector<int> productExceptSelf(vector<int> &nums) {
+        vector<int> res;
+        int t = 1;
+        for (int num : nums) {
+            res.push_back(t);
+            t *= num;
+        }
+        t = 1;
+        for (int i = nums.size() - 1; i >= 0; --i) {
+            res[i] *= t;
+            t *= nums[i];
+        }
+        return res;
+    }
+};
+// @lc code=end

LeetCode/C/279-dynamic-programming-完全平方数.cpp

@@ -0,0 +1,21 @@
+/*
+ * @lc app=leetcode.cn id=279 lang=cpp
+ *
+ * [279] 完全平方数
+ */
+#include "main.h"
+
+// @lc code=start
+class Solution {
+  public:
+    int numSquares(int n) {
+        vector<int> dp(n + 1);
+        for (int i = 1; i <= n; i++) {
+            dp[i] = i;
+            for (int j = 1; j * j <= i; ++j)
+                dp[i] = min(dp[i], dp[i - j * j] + 1);
+        }
+        return dp[n];
+    }
+};
+// @lc code=end

LeetCode/C/55-greedy-跳跃游戏.cpp

@@ -9,11 +9,11 @@
 class Solution {
   public:
     bool canJump(vector<int> &nums) {
-        int m_pos = 0;
+        int max_pos = 0;
         for (int i = 0; i < nums.size(); i++) {
-            if (i > m_pos)
+            if (i > max_pos)
                 return false;
-            m_pos = max(m_pos, i + nums[i]);
+            max_pos = max(max_pos, i + nums[i]);
         }
         return true;
     }

MIOJ/001.c

@@ -0,0 +1,8 @@
+#include <stdio.h>
+
+int main() {
+    long long a, b;
+    while (scanf("%lld%lld", &a, &b) != EOF)
+        printf("%lld\n", a + b);
+    return 0;
+}

MIOJ/001.cpp

@@ -0,0 +1,9 @@
+#include <stdio.h>
+
+int main() {
+    int res = 0, t;
+    while (scanf("%d", &t) != EOF)
+        res ^= t;
+    printf("%d\n", res);
+    return 0;
+}

MIOJ/002.c

@@ -0,0 +1,17 @@
+#include <stdio.h>
+
+int main() {
+    int n;
+    scanf("%d", &n);
+    if (n <= 2)
+        printf("%d", n);
+    else {
+        int a = 1, b = 2;
+        for (int i = 3; i <= n; i++) {
+            b = a + b;
+            a = b - a;
+        }
+        printf("%d", b);
+    }
+    return 0;
+}

MIOJ/002.cpp

@@ -0,0 +1,48 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define MAXN 100010
+
+int a[MAXN], b[MAXN];
+
+void build(int n, int t[]) {
+    memset(t, -1, sizeof(int) * MAXN);
+    int data, idx;
+    while (n--) {
+        idx = 1;
+        scanf("%d", &data);
+        while (1) {
+            if (t[idx] == -1) {
+                t[idx] = data;
+                break;
+            } else if (data < t[idx])
+                idx <<= 1;
+            else
+                idx = idx * 2 + 1;
+        }
+    }
+}
+
+int check(int n) {
+    for (int i = 1; i <= 2 * n + 1; i++)
+        if (a[i] != b[i])
+            return 0;
+    return 1;
+}
+
+int main() {
+    int n, l;
+    while (scanf("%d", &n) != EOF && n != 0) {
+        scanf("%d", &l);
+        build(n, a);
+        while (l--) {
+            build(n, b);
+            if (check(n))
+                printf("Yes\n");
+            else
+                printf("No\n");
+        }
+    }
+    return 0;
+}