|
| 1 | +*&---------------------------------------------------------------------* |
| 2 | +*& Report Z_LC_PALINDROME_PERMUTATION |
| 3 | +*&---------------------------------------------------------------------* |
| 4 | +*& |
| 5 | +*&---------------------------------------------------------------------* |
| 6 | +REPORT z_lc_palindrome_permutation. |
| 7 | + |
| 8 | + |
| 9 | +CLASS lcl_main DEFINITION. |
| 10 | + PUBLIC SECTION. |
| 11 | + TYPES: tt_array TYPE STANDARD TABLE OF c WITH DEFAULT KEY. |
| 12 | + DATA: mt_array TYPE tt_array, |
| 13 | + mt_permute TYPE SORTED TABLE OF string WITH UNIQUE DEFAULT KEY. |
| 14 | + METHODS: string_to_array IMPORTING str TYPE string |
| 15 | + RETURNING VALUE(rt_array) TYPE tt_array, |
| 16 | + array_to_string IMPORTING im_array TYPE tt_array |
| 17 | + RETURNING VALUE(rv_str) TYPE string, |
| 18 | + calc_permutations IMPORTING im_str TYPE string |
| 19 | + left TYPE i |
| 20 | + right TYPE i, |
| 21 | + check_palindrome IMPORTING im_str TYPE string |
| 22 | + RETURNING VALUE(rv_is_palindrome) TYPE boolean, |
| 23 | + swap IMPORTING im_str TYPE string |
| 24 | + start_index TYPE i |
| 25 | + target_index TYPE i |
| 26 | + RETURNING VALUE(rv_str) TYPE string. |
| 27 | + |
| 28 | + |
| 29 | +ENDCLASS. |
| 30 | + |
| 31 | +CLASS lcl_main IMPLEMENTATION. |
| 32 | + METHOD string_to_array. |
| 33 | + DATA: lv_index TYPE i. |
| 34 | + DATA: lt_str TYPE TABLE OF c. |
| 35 | + DATA: lv_length TYPE i. |
| 36 | + |
| 37 | + lv_length = strlen( str ). |
| 38 | + |
| 39 | + WHILE lv_index < strlen( str ). |
| 40 | + |
| 41 | + DATA(lv_char) = str+lv_index(1). |
| 42 | + APPEND lv_char TO lt_str. |
| 43 | + ADD 1 TO lv_index. |
| 44 | + ENDWHILE. |
| 45 | + |
| 46 | + rt_array = lt_str. |
| 47 | + ENDMETHOD. |
| 48 | + |
| 49 | + METHOD calc_permutations. |
| 50 | + |
| 51 | + IF left = right. |
| 52 | + IF check_palindrome( im_str ) IS NOT INITIAL. |
| 53 | + INSERT im_str INTO TABLE mt_permute. |
| 54 | + ENDIF. |
| 55 | + ELSE. |
| 56 | + DATA(i) = left. |
| 57 | + WHILE i <= right. |
| 58 | + |
| 59 | + DATA(lv_str) = swap( EXPORTING im_str = im_str |
| 60 | + start_index = left |
| 61 | + target_index = i ). |
| 62 | + DATA(lv_left) = left + 1. |
| 63 | + calc_permutations( EXPORTING im_str = lv_str |
| 64 | + left = lv_left |
| 65 | + right = right ). |
| 66 | + i = i + 1. |
| 67 | + ENDWHILE. |
| 68 | + ENDIF. |
| 69 | + |
| 70 | + ENDMETHOD. |
| 71 | + |
| 72 | + METHOD check_palindrome. |
| 73 | + DATA: lv_reverse TYPE string. |
| 74 | + |
| 75 | + lv_reverse = reverse( im_str ). |
| 76 | + |
| 77 | + IF to_lower( im_str ) = to_lower( lv_reverse ). |
| 78 | + rv_is_palindrome = abap_true. |
| 79 | + ELSE. |
| 80 | + rv_is_palindrome = abap_false. |
| 81 | + ENDIF. |
| 82 | + ENDMETHOD. |
| 83 | + |
| 84 | + METHOD array_to_string. |
| 85 | + LOOP AT im_array INTO DATA(lv_char). |
| 86 | + rv_str = rv_str && lv_char. |
| 87 | + ENDLOOP. |
| 88 | + ENDMETHOD. |
| 89 | + |
| 90 | + METHOD swap. |
| 91 | + DATA: lv_temp TYPE c. |
| 92 | + DATA: lt_str TYPE TABLE OF c. |
| 93 | + |
| 94 | + lt_str = string_to_array( im_str ). |
| 95 | + lv_temp = lt_str[ start_index ]. |
| 96 | + lt_str[ start_index ] = lt_str[ target_index ]. |
| 97 | + lt_str[ target_index ] = lv_temp. |
| 98 | + |
| 99 | + rv_str = array_to_string( lt_str ). |
| 100 | + |
| 101 | + ENDMETHOD. |
| 102 | +ENDCLASS. |
| 103 | + |
| 104 | + |
| 105 | +START-OF-SELECTION. |
| 106 | + |
| 107 | + DATA: lv_str TYPE string VALUE 'carerac'. |
| 108 | + DATA: lt_str TYPE TABLE OF c. |
| 109 | + DATA: lo_obj TYPE REF TO lcl_main. |
| 110 | + DATA: lv_last TYPE c. |
| 111 | + |
| 112 | + CREATE OBJECT lo_obj. |
| 113 | + |
| 114 | + lt_str = lo_obj->string_to_array( lv_str ). |
| 115 | + DATA(lv_len) = strlen( lv_str ). |
| 116 | + |
| 117 | + lo_obj->calc_permutations( EXPORTING im_str = lv_str |
| 118 | + left = 1 |
| 119 | + right = lv_len ). |
| 120 | + |
| 121 | + BREAK-POINT. |
0 commit comments