| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #include "kulikov_d_coun_number_char/seq/include/ops_seq.hpp" | ||
| 2 | |||
| 3 | #include <algorithm> | ||
| 4 | #include <cstddef> | ||
| 5 | |||
| 6 | #include "kulikov_d_coun_number_char/common/include/common.hpp" | ||
| 7 | |||
| 8 | namespace kulikov_d_coun_number_char { | ||
| 9 | |||
| 10 | ✗ | KulikovDiffCountNumberCharSEQ::KulikovDiffCountNumberCharSEQ(const InType &in) { | |
| 11 | SetTypeOfTask(GetStaticTypeOfTask()); | ||
| 12 | GetInput() = in; | ||
| 13 | ✗ | GetOutput() = 0; | |
| 14 | ✗ | } | |
| 15 | |||
| 16 | ✗ | bool KulikovDiffCountNumberCharSEQ::ValidationImpl() { | |
| 17 | ✗ | return true; | |
| 18 | } | ||
| 19 | |||
| 20 | ✗ | bool KulikovDiffCountNumberCharSEQ::PreProcessingImpl() { | |
| 21 | ✗ | return true; | |
| 22 | } | ||
| 23 | |||
| 24 | ✗ | bool KulikovDiffCountNumberCharSEQ::RunImpl() { | |
| 25 | const auto &[s1, s2] = GetInput(); | ||
| 26 | |||
| 27 | size_t min_len = std::min(s1.size(), s2.size()); | ||
| 28 | size_t max_len = std::max(s1.size(), s2.size()); | ||
| 29 | |||
| 30 | int diff_count = 0; | ||
| 31 | |||
| 32 | // cчитаем несовпадения по диапазону | ||
| 33 | ✗ | for (size_t i = 0; i < min_len; ++i) { | |
| 34 | ✗ | if (s1[i] != s2[i]) { | |
| 35 | ✗ | diff_count++; | |
| 36 | } | ||
| 37 | } | ||
| 38 | |||
| 39 | ✗ | diff_count += static_cast<int>(max_len - min_len); | |
| 40 | |||
| 41 | ✗ | GetOutput() = diff_count; | |
| 42 | ✗ | return true; | |
| 43 | } | ||
| 44 | |||
| 45 | ✗ | bool KulikovDiffCountNumberCharSEQ::PostProcessingImpl() { | |
| 46 | ✗ | return true; | |
| 47 | } | ||
| 48 | |||
| 49 | } // namespace kulikov_d_coun_number_char | ||
| 50 |