From a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Fri, 27 Jun 2025 12:23:02 -0600 Subject: chore: remove old cpp and rust solutions --- other/min_cost_change_expr.cpp | 40 ---------------------------------------- 1 file changed, 40 deletions(-) delete mode 100644 other/min_cost_change_expr.cpp (limited to 'other/min_cost_change_expr.cpp') diff --git a/other/min_cost_change_expr.cpp b/other/min_cost_change_expr.cpp deleted file mode 100644 index c75d10c..0000000 --- a/other/min_cost_change_expr.cpp +++ /dev/null @@ -1,40 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int minOperationsToFlip(string expression) { - vector>> vva(1); - for (auto ch : expression) { - if (ch == '(') - vva.push_back(vector>()); - else if (ch == ')') { - auto val = eval(vva.back(), vva.back().size() - 1); - vva.pop_back(); - vva.back().push_back(val); - } else - vva.back().push_back({ch, 1}); - } - return eval(vva.back(), vva.back().size() - 1)[1]; - } - -private: - array eval(vector> &exp, int i) { - if (i == 0) - return exp[0]; - auto left = eval(exp, i - 2), right = exp[i]; - int v1 = left[0] - '0', v2 = right[0] - '0', cost = 1; - if (exp[i - 1][0] == '|') { - if (v1 == v2) - cost = min(left[1], right[1]) + (v1 == 1); - return {v1 | v2 ? '1' : '0', (char)cost}; - } - if (v1 == v2) - cost = min(left[1], right[1]) + (v1 == 0); - return {v1 & v2 ? '1' : '0', (char)cost}; - } -}; - -int main() { - Solution obj; - cout << obj.minOperationsToFlip("(0|(1|0&1))"); -} -- cgit v1.2.3