diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/pseudo_palindrome_binary_tree.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/pseudo_palindrome_binary_tree.cpp')
-rw-r--r-- | other/pseudo_palindrome_binary_tree.cpp | 29 |
1 files changed, 0 insertions, 29 deletions
diff --git a/other/pseudo_palindrome_binary_tree.cpp b/other/pseudo_palindrome_binary_tree.cpp deleted file mode 100644 index 63b2cac..0000000 --- a/other/pseudo_palindrome_binary_tree.cpp +++ /dev/null @@ -1,29 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int pseudoPalindromicPaths(TreeNode *root) { - vector<int> v(10, 0); - dfs(root, v); - return count; - } - -private: - int count = 0; - void dfs(TreeNode *root, vector<int> v) { - if (root == NULL) - return; - v[root->val]++; - if (root->left == NULL && root->right == NULL) { - int oddCount = 0; - for (auto x : v) - if (x % 2) - oddCount++; - if (oddCount <= 1) - count++; - return; - } - dfs(root->left, v); - dfs(root->right, v); - } -}; |