ILOCNEAM

3.3.1. The MultiArray abstract data type A multi-dimensional array consists of a collection of elements organized into multiple dimensions. Individual elements are referenced by specifying an n-tuple or a subscript of multiple components, one for each dimension of the array. All indices of the n-tuple start at zero. MultiArray(d1, d2, ...dn) # creates a multi-dimensional array of elements organi..

Data structures and algorithm > ch.3 sets and maps > 3.2. maps A map is a container for storing a collection of data records in which each record is associated with a unique key. The key components must be comparable Map() # Creates a new empty map length() # returns the number of key/vlaue pairs in the map contains(key) # determines if the given key is in the map and returns True if the key is ..

Data structures and algorithm > ch.3 sets and maps > 3.1. set set() # create a new set initialized to the empty set len() # returns the number of elements in the set, also known as the cardinlity contains(element) # determines if the given value is an element of the set if the element is not already a memeber # if the element is not unique, no action is taken and the operation is skipped remove(..

1. linear search 리스트 처음부터 끝까지 하나씩 비교해가며 찾는 방법 Time complexity 는 O(N) def LinearSearch(list, value): for i in range (len(list)): if list[i] == value: return i return -1 2. Binary search (리스트가 정렬 되어있다는 전제에서 search) 리스트 중간 value 와 비교하여 리스트의 절반에서 탐색하는 방법 Time complexity 는 O(log N) def BinarySearch(list, value): first = 0 last = len(list) - 1 while first

11654번 아스키 코드 inputletter = input() print(ord(inputletter)) 11720번 숫자의 합 length = int(input()) numbers = input() ans = 0 for i in range (length): ans += int(numbers[i]) print(ans) 10809 알파벳 찾기 S = input() alphabet = {'a': -1, 'b': -1, 'c': -1, 'd': -1, 'e': -1, 'f': -1, 'g': -1, 'h': -1, 'i': -1, 'j': -1, 'k': -1, 'l': -1, 'm': -1, 'n': -1, 'o': -1, 'p': -1, 'q': -1, 'r': -1, 'x': -1, 't': -1, '..

15596번 정수 N개의 합 def solve(a): ans = 0 for i in a: ans += i return ans 4673번 셀프넘버 def sumDigit(n): ans = 0 while n > 9: ans += n%10 n = n//10 return ans + n def ifSelf(n): i = 0 while i < n: if sumDigit(i) + i == n: return i += 1 print(i) i = 1 while i < 10000: ifSelf(i) i += 1 이렇게 했더니 시간초과가 떴다...ㅠ 수정해야지... 1065번 한수 count = 0 naturalN = input() i = 1 while i

10818 최소, 최대 최솟값과 최댓값을 찾는 문제 num = int(input()) num_list = list(map(int, input().split())) min_list = num_list[0] max_list = num_list[0] i = 0 while i in range(num): if num_list[i] max_list: max_list = num_list[i] i += 1 print(min_list, max_list) 2562 최댓값 최댓값이 어디에 있는지 찾는 문제 num_list = [] for i in range(9): num_list.append(int(input())) print(ma..