alaisgomes
/ gist:988d07d50dcfa4beaa53
Created
January 14, 2011 21:37
Jogo de Dominó FINAL - certo e completo.
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
| #include <stdio.h> | |
| #include <time.h> | |
| #include <stdlib.h> | |
| #include <string.h> | |
| /*FUNCAO 1: PARA DISTRIBUIR PECAS PARA OS JOGADORES | |
| descricao: com um vetor auxiliar, randomiza as pedras do jogo e depois as distribui entre os jogadores | |
| */ | |
| void Distribuir (int *player1, int *player2) { |
alaisgomes
/ find_largest_substring.py
Created
July 14, 2019 12:03
Find largest substring without repeating characters
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 find_substring(string): | |
| """ Function that returns the longest | |
| substring without repetition | |
| """ | |
| max_length = 0 | |
| init_sub = -1 | |
| letters_dict = {} | |
| for idx, letter in enumerate(string): | |
| if letter in letters_dict: |