Palindrome/de: what changed
Revision 1 to 2. Removed lines have a minus sign; added lines have a plus sign.
| Old | New | Line | |
|---|---|---|---|
| 1 | - | ||
| 2 | - | ||
| 3 | - | ||
| 4 | - | ||
| 5 | - | ||
| 6 | - | ||
| 7 | - | ||
| 1 | + |  | |
| 8 | 2 | ||
| 9 | 3 | # Palindrom | |
| 10 | 4 | ||
| 11 | - | ||
| 12 | 5 | Definition:\ | |
| 13 | 6 | Ein Palindrom ist eine Zeichenkette, die von vorn und von hinten gelesen dasselbe ergibt.\ | |
| 14 | - | ||
| 7 | + | ||
| 15 | 8 | = Beispiele =\ | |
| 16 | 9 | == Deutsch == | |
| 17 | 10 | ||
| 18 | 11 | - aha | |
| 19 | 12 | - Ebbe | |
| 20 | 13 | - Elle | |
| 21 | 14 | - Esse | |
| 22 | 15 | - Neffen | |
| 23 | 16 | - Otto | |
| 24 | 17 | - Rentner | |
| 25 | 18 | - Uhu | |
| 26 | 19 | - Die Liebe ist Sieger; rege ist sie bei Leid. | |
| 27 | 20 | ||
| 28 | 21 | ## Englisch | |
| 29 | 22 | ||
| 30 | 23 | - racecar | |
| 31 | 24 | - A man, a plan, a canal: Panama | |
| 32 | 25 | - Madam I'm Adam | |
| 33 | 26 | ||
| 34 | - | ||
| 35 | - | ||
| 36 | 27 | = Die Funktion IsPalindome = Diese Funktion passt für die ASCII und UTF-8 String-Codierung.\ | |
| 37 | 28 | ||
| 38 | 29 | ``` pascal | |
| 39 | 30 | ||
| 40 | 31 | function IsPalindome(const a_text: string): boolean; | |
| 41 | 32 | var | |
| 42 | 33 | i, j :longint; | |
| 43 | 34 | s1, s2, s3 :string; | |
| 44 | 35 | begin | |
| 45 | 36 | s1 := UTF8LowerCase( a_text ); | |
| 46 | 37 | j := length( s1 ); | |
| 47 | 38 | i := 1; | |
| 48 | 39 | s2 := ''; | |
| 49 | 40 | s3 := ''; | |
| 50 | 41 | while ( i <= j ) do | |
| 51 | 42 | begin | |
| 52 | 43 | if s1[i] < #$C0 then // ASCII | |
| 53 | 44 | begin | |
| 54 | 45 | if (s1[i] >= #$30) and (s1[i] < #$7B)then | |
| 55 | 46 | begin | |
| 56 | 47 | if (s1[i] > #$60) or (s1[i] < #$3A) then | |
| 57 | 48 | begin | |
| 58 | 49 | s2 := s1[i] + s2; | |
| 59 | 50 | s3 := s3 + s1[i]; | |
| 60 | 51 | end; | |
| 61 | 52 | end; | |
| 62 | 53 | inc( i ); | |
| 63 | 54 | end | |
| 64 | 55 | else | |
| 65 | 56 | begin | |
| 66 | 57 | begin | |
| 67 | 58 | if s1[i] < #$E0 then // two byte | |
| 68 | 59 | begin | |
| 69 | 60 | if ((s1[i] > #$C2) and ( not | |
| 70 | 61 | // Armenian punctuation | |
| 71 | 62 | ((s1[i] = #$D5) and ((s1[i+1] >= #$99) and (s1[i+1] < #$A0))) | |
| 72 | 63 | )) then | |
| 73 | 64 | begin | |
| 74 | 65 | s2 := s1[i]+ s1[i+1] + s2; | |
| 75 | 66 | s3 := s3 + s1[i] + s1[i+1]; | |
| 76 | 67 | end; | |
| 77 | 68 | inc( i ,2); | |
| 78 | 69 | end | |
| 79 | 70 | else | |
| 80 | 71 | begin | |
| 81 | 72 | if s1[i] < #$F0 then // three byte | |
| 82 | 73 | begin | |
| 83 | 74 | if not ( | |
| 84 | 75 | // General punctuation | |
| 85 | 76 | (s1[i] = #$E2) and ((s1[i+1]= #$80) | |
| 86 | 77 | or ((s1[i+1]= #$81) and (s1[i+2]< #$B0))) | |
| 87 | 78 | ) then | |
| 88 | 79 | begin | |
| 89 | 80 | s2 := s1[i]+ s1[i+1] + s1[i+2]+ s2; | |
| 90 | 81 | s3 := s3 + s1[i] + s1[i+1] + s1[i+2]; | |
| 91 | 82 | end; | |
| 92 | 83 | inc( i ,3); | |
| 93 | 84 | end | |
| 94 | 85 | else | |
| 95 | 86 | begin | |
| 96 | 87 | s2 := s1[i]+ s1[i+1] + s1[i+2]+ s1[i+3] + s2; | |
| 97 | 88 | s3 := s3 + s1[i] + s1[i+1] + s1[i+2] + s1[i+3]; | |
| 98 | 89 | inc( i ,4); | |
| 99 | 90 | end | |
| 100 | 91 | end; | |
| 101 | 92 | end; | |
| 102 | 93 | end; | |
| 103 | 94 | end; | |
| 104 | 95 | if s2 <> '' then result := s2=s3 else result := false; | |
| 105 | 96 | end; | |
| 106 | 97 | ``` | |
| 107 | 98 | ||
| 108 | 99 | --- | |
| 109 | 100 | *From the Free Pascal wiki, page "Palindrome/de", as it stood on 2020-02-23 after a change by Trev, out of the wiki's dump of 2024-05-26. Copyright stays with the author who wrote it, according to the old wiki's [[Licensing]] page. If you have concerns about this material, [message the admin](/wiki-contact).* |
