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/two_sum_4.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/two_sum_4.cpp')
-rw-r--r-- | other/two_sum_4.cpp | 24 |
1 files changed, 0 insertions, 24 deletions
diff --git a/other/two_sum_4.cpp b/other/two_sum_4.cpp deleted file mode 100644 index c25bcc9..0000000 --- a/other/two_sum_4.cpp +++ /dev/null @@ -1,24 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - bool findTarget(TreeNode *root, int k) { - vector<int> nums; - order(root, nums); - for (int i = 0, j = nums.size() - 1; i < j;) { - if (nums[i] + nums[j] == k) - return true; - (nums[i] + nums[j] < k) ? i++ : j--; - } - return false; - } - -private: - void order(TreeNode *root, vector<int> &nums) { - if (root == NULL) - return; - order(root->left, nums); - nums.push_back(root->val); - order(root->right, nums); - } -}; |