This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Strasbourg | |
| Lille Flandres | |
| Lyon-Perrache | |
| Marseille-St-Charles | |
| Metz-Ville | |
| Bordeaux-St-Jean | |
| Toulouse-Matabiau | |
| Avignon-Centre | |
| Nantes | |
| Mulhouse |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Strasbourg | |
| Lille Flandres | |
| Lyon-Part-Dieu | |
| Nancy-Ville | |
| Marseille-St-Charles | |
| Bordeaux-St-Jean | |
| Toulouse-Matabiau | |
| Nantes | |
| Rennes | |
| Lyon-Perrache |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Port-Vendres | |
| Roscoff | |
| Toulouse-Matabiau | |
| Sarreguemines | |
| Lyon-Part-Dieu | |
| Romorantin-Blanc-Argent | |
| Veynes-Dévoluy | |
| Calais Ville | |
| Lannion | |
| Hazebrouck |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Trie: | |
| def __init__(self): | |
| self.children={} | |
| self.label=None | |
| def findall(self): | |
| matches=set() | |
| if self.label!=None: | |
| matches.add(self.label) | |
| for child in self.children: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def maxsubarr(arr): | |
| h=len(arr) | |
| w=len(arr[0]) | |
| bestsum=arr[0][0] | |
| bestcoords=None | |
| for lbeg in range(h): | |
| for cbeg in range(w): | |
NewerOlder