-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlists.py
94 lines (78 loc) · 1.59 KB
/
lists.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
# Array Sum
# def arraySum(li):
# sum = 0
# for ele in li:
# sum += ele
# return sum
# n = int(input())
# li = [int(x) for x in input().split()]
# print(arraySum(li))
# Swap Alternate
'''
t = int(input())
while t>0:
n = int(input())
li = [int(x) for x in input().split()]
# if n%2 == 0:
# for i in range(0, n, 2):
# li[i], li[i+1] = li[i+1], li[i]
# else:
# for i in range(0, n-1, 2):
# li[i], li[i+1] = li[i+1], li[i]
if n%2 != 0:
n -= 1
li[:n:2], li[1:n:2] = li[1:n:2], li[:n:2]
for ele in li:
print(ele, end=" ")
print()
t -= 1
'''
# Find Unique
'''
t = int(input())
while t>0:
ans = 0
n = int(input())
li = [int(x) for x in input().split()]
for ele in li:
ans = ele ^ ans
print(ans)
t -= 1
'''
# Find Duplicate
'''
t = int(input())
while t>0:
ans = -1
n = int(input())
li = [int(x) for x in input().split()]
for i in range(n):
for j in range(i+1, n):
if li[i] == li[j]:
ans = li[i]
break
if ans == li[i]:
break
print(ans)
t -= 1
'''
# Array Intersection
'''
t = int(input())
while t>0:
n = int(input())
li1 = [int(x) for x in input().split()]
m = int(input())
li2 = [int(x) for x in input().split()]
ans = []
for ele1 in li1:
for ele2 in li2:
if ele1 == ele2:
li2.remove(ele2)
ans.append(ele1)
break
for ele in ans:
print(ele, end=" ")
print()
t -= 1
'''