Mathis HAMMEL MathisHammel
MathisHammel
/ couverture_gare_126tri.txt
Created
June 15, 2018 21:52
This file contains 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 |
MathisHammel
/ couverture_gare_129tri.txt
Created
June 15, 2018 19:52
This file contains 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 |
MathisHammel
/ couverture_gare_129.txt
Created
June 15, 2018 17:58
This file contains 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 |
MathisHammel
/ directoryTrie.py
Created
January 5, 2017 03:16
Simple implementation of a trie to show phone number autocompletion
This file contains 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: |
MathisHammel
/ subarraysum.py
Created
December 19, 2016 01:11
This file contains 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