JIE0025

https://app.codility.com/programmers/lessons/16-greedy_algorithms/ 16. Greedy algorithms lesson - Learn to Code - Codility Tie adjacent ropes to achieve the maximum number of ropes of length >= K. app.codility.com There are N ropes numbered from 0 to N − 1, whose lengths are given in an array A, lying on the floor in a line. For each I (0 ≤ I < N), the length of rope I on the line is A[I]. # 0~ ..

An array A consisting of N different integers is given. # N개의 다른 정수로 구성된 배열 A The array contains integers in the range [1..(N + 1)], which means that exactly one element is missing. Your goal is to find that missing element. #배열은 1부터 N+1의 값을 포함한다. (1요소만 없음) #목표는 없는 요소를 찾는것! Write a function: def solution(A) that, given an array A, returns the value of the missing element. #A가 주어졌을 떄 없어진 값을 반환하라...