GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — algorithms/algorithms/backtrack/anagram.py at master · oldmonad/algorithms Expand file tree/ Copy pathanagram.pyMore file actions 22 lines (16 loc) · 373 Bytes / Copy pathanagram.pyFile metadata and controls22 lines (16 loc) · 373 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 """ Given two strings, determine if they are equal after reordering. Examples: "apple", "pleap" -> True "apple", "cherry" -> False """ def anagram(s1, s2): c1 = [0] * 26 c2 = [0] * 26 for c in s1: pos = ord(c)-ord('a') c1[pos] = c1[pos] + 1 for c in s2: pos = ord(c)-ord('a') c2[pos] = c2[pos] + 1 return c1 == c2 |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |