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/num_same_consecutive_diff.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/num_same_consecutive_diff.cpp')
-rw-r--r-- | other/num_same_consecutive_diff.cpp | 32 |
1 files changed, 0 insertions, 32 deletions
diff --git a/other/num_same_consecutive_diff.cpp b/other/num_same_consecutive_diff.cpp deleted file mode 100644 index 0602ce1..0000000 --- a/other/num_same_consecutive_diff.cpp +++ /dev/null @@ -1,32 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - vector<int> numsSameConsecDiff(int n, int k) { - vector<int> ans; - for (int i = 1; i < 10; i++) - findNum(i, n, k, ans); - return ans; - } - -private: - int digits(int x) { - int count = 0; - while (x) { - count++; - x /= 10; - } - return count; - } - void findNum(int curr, int n, int k, vector<int> &ans) { - if (digits(curr) == n) { - ans.push_back(curr); - return; - } - for (int i = 0; i < 10; i++) { - int last = curr % 10; - if (abs(last - i) == k) - findNum((curr * 10 + i), n, k, ans); - } - } -}; |