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/set_mismatch.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/set_mismatch.cpp')
-rw-r--r-- | other/set_mismatch.cpp | 19 |
1 files changed, 0 insertions, 19 deletions
diff --git a/other/set_mismatch.cpp b/other/set_mismatch.cpp deleted file mode 100644 index 8c216bc..0000000 --- a/other/set_mismatch.cpp +++ /dev/null @@ -1,19 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - vector<int> findErrorNums(vector<int> &nums) { - int p = 0, ac1 = 0, ac2 = 0; - for (uint i = 0; i < nums.size(); ++i) - p ^= (i + 1) ^ nums[i]; - p &= -p; - for (uint i = 0; i < nums.size(); ++i) { - ((nums[i] & p) == 0) ? ac1 ^= nums[i] : ac2 ^= nums[i]; - (((i + 1) & p) == 0) ? ac1 ^= i + 1 : ac2 ^= i + 1; - } - for (auto n : nums) - if (n == ac1) - return {ac1, ac2}; - return {ac2, ac1}; - } -}; |