From dc1f0c4c0096013799416664894c5194dc7e1f52 Mon Sep 17 00:00:00 2001
From: Yuqian Yang <crupest@crupest.life>
Date: Fri, 28 Feb 2025 23:13:39 +0800
Subject: chore(store): move everything to store.

---
 store/works/solutions/leetcode/week/260/2.cpp | 29 +++++++++++++++++++++++++++
 1 file changed, 29 insertions(+)
 create mode 100644 store/works/solutions/leetcode/week/260/2.cpp

(limited to 'store/works/solutions/leetcode/week/260/2.cpp')

diff --git a/store/works/solutions/leetcode/week/260/2.cpp b/store/works/solutions/leetcode/week/260/2.cpp
new file mode 100644
index 0000000..86c4cf2
--- /dev/null
+++ b/store/works/solutions/leetcode/week/260/2.cpp
@@ -0,0 +1,29 @@
+#include <vector>
+
+using std::vector;
+
+#include <iterator>
+#include <limits>
+#include <numeric>
+
+class Solution {
+public:
+  long long gridGame(vector<vector<int>> &grid) {
+    int s = grid.front().size();
+    std::vector<long long> row0(grid[0].cbegin(), grid[0].cend());
+    std::vector<long long> row1(grid[1].cbegin(), grid[1].cend());
+    std::vector<long long> ps0, ps1;
+
+    std::partial_sum(row0.cbegin(), row0.cend(), std::back_inserter(ps0));
+    std::partial_sum(row1.cbegin(), row1.cend(), std::back_inserter(ps1));
+
+    long long r = std::numeric_limits<long long>::max();
+
+    for (int i = 0; i < s; i++) {
+      long long c = std::max(ps0.back() - ps0[i], i ? ps1[i - 1] : 0);
+      r = std::min(r, c);
+    }
+
+    return r;
+  }
+};
\ No newline at end of file
-- 
cgit v1.2.3