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/remove_element.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/remove_element.cpp')
-rw-r--r-- | other/remove_element.cpp | 28 |
1 files changed, 0 insertions, 28 deletions
diff --git a/other/remove_element.cpp b/other/remove_element.cpp deleted file mode 100644 index 644f239..0000000 --- a/other/remove_element.cpp +++ /dev/null @@ -1,28 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int removeElement(vector<int> &nums, int val) { - int idx = 0, k = nums.size(); - while (idx < k) { - if (nums[idx] == val) { - // cout << "idx " << idx << endl; - // cout << "k " << k << endl; - nums[idx] = nums[k - 1]; - --k; - } else - ++idx; - } - return k; - } -}; - -int main() { - Solution obj; - vector<int> nums = {0, 1, 2, 2, 3, 0, 4, 2}; - int val = 2; - for (int i = 0; i < nums.size(); i++) - cout << nums[i] << ' '; - cout << endl << nums.size() << endl; - cout << obj.removeElement(nums, val); -} |