Given a list of strings, returns the longest common prefix
(m)
| 224 | |
| 225 | |
| 226 | def commonprefix(m): |
| 227 | "Given a list of strings, returns the longest common prefix" |
| 228 | if not m: |
| 229 | return '' |
| 230 | s1 = min(m) |
| 231 | s2 = max(m) |
| 232 | for i, c in enumerate(s1): |
| 233 | if c != s2[i]: |
| 234 | return s1[:i] |
| 235 | return s1 |
| 236 | |
| 237 | |
| 238 | def format_value(val): |
no test coverage detected
searching dependent graphs…