배열이 주어지면 최대, 최소, 두 번째로 큰, 두 번째로 작은 수를 찾아야 합니다.
알고리즘
Step 1: input list element Step 2: we take a number and compare it with all other number present in the list. Step 3: get maximum, minimum, secondlargest, second smallest number.
예시 코드
# To find largest, smallest, second largest and second smallest in a List
def maxmin(A):
maxi = A[0]
secondsmax = A[0]
mini = A[0]
secondmini = A[0]
for item in A:
if item > maxi:
maxi = item
elif secondsmax!=maxi and secondsmax < item:
secondsmax = item
elif item < mini:
mini = item
elif secondmini != mini and secondmini > item:
secondmini = item
print("Largest element is ::>", maxi)
print("Second Largest element is ::>", secondsmax)
print("Smallest element is ::>", mini)
print("Second Smallest element is ::>", secondmini)
# Driver Code
A=list()
n=int(input("Enter the size of the List ::"))
print("Enter the number ::")
for i in range(int(n)):
k=int(input(""))
A.append(int(k))
maxmin(A) 출력
Enter the size of the List ::6 Enter the number :: 12 30 2 34 90 67 Largest element is ::> 90 Second Largest element is ::> 67 Smallest element is ::> 2 Second Smallest element is ::> 12