Repository navigation
Expand file tree
/
Copy pathlist.py
More file actions
234 lines (184 loc) · 4.32 KB
/
Copy pathlist.py
File metadata and controls
234 lines (184 loc) · 4.32 KB
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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
# python data type :
"""
1. string : immutable ==> no changes in string .
2. list : mutable ==> you can change the list
3. tuple : immutable ==> you can't change in tuple
4. dict : mutable ==> you can changes in dict
5. set : mutable == > you can changes in set
"""
#list : mutable
"""
l1=[1,2,3,4,5,6,7,9,10,"ram"]
print(l1)
print(type(l1))
"""
# buit in function : len min max sorted sum
# l1=[100,2,3,4,5,6,7,9,10]
"""print(len(l1))
print(min(l1))
print(max(l1))
print(sorted(l1))
print(sum(l1))
"""
#slicing :
# l1= [10,20,30,40,50,60,70,90,10]
# index : 0 pos right : l to r
# neg index num: -1 : r to l
# print(l1)
# print(l1[2]) # index : 2
# print(l1[3 :5]) # start pos : 3 ending pos : 5
# print(l1[ : 6]) # starting pos by default : 0
# print(l1[ 1: ]) # ending pos upto the list len
# print(l1[ : ])
# print(l1[-2])
# print(l1[3 : -2])
# print(l1[-3 : 7])
# print(l1[2 : 7 : 2 ]) # start : 2 end : 7 step size : 2
# print(l1[ : : -1])
# python data type :
"""
1. string : immutable ==> no changes in string .
2. list : mutable ==> you can change the list
3. tuple : immutable ==> you can't change in tuple
4. dict : mutable ==> you can changes in dict
5. set : mutable == > you can changes in set
"""
#list : mutable
"""
l1=[1,2,3,4,5,6,7,9,10,"ram"]
print(l1)
print(type(l1))
"""
# buit in function : len min max sorted sum
# l1=[100,2,3,4,5,6,7,9,10]
"""print(len(l1))
print(min(l1))
print(max(l1))
print(sorted(l1))
print(sum(l1))
"""
#slicing :
# l1= [10,20,30,40,50,60,70,90,10]
# index : 0 pos right : l to r
# neg index num: -1 : r to l
# print(l1)
# print(l1[2]) # index : 2
# print(l1[3 :5]) # start pos : 3 ending pos : 5
# print(l1[ : 6]) # starting pos by default : 0
# print(l1[ 1: ]) # ending pos upto the list len
# print(l1[ : ])
# print(l1[-2])
# print(l1[3 : -2])
# print(l1[-3 : 7])
# print(l1[2 : 7 : 2 ]) # start : 2 end : 7 step size : 2
# print(l1[ : : -1])
# method :
# l1 = [100,2,3,4,5,6,7,9,10,10,10]
# l1.append(250)
# print(l1)
# l1.clear()
# print(l1)
# l2=l1.copy()
# print(l2)
# l2=["apple", "kiwi","banana"]
# l1.extend(l2)
# print(l1)
# print(l1.index(5))
# l1.insert(2,"ragahv")
# print(l1)
# l1.pop(2)
# print(l1)
# l1.remove(10)
# print(l1)
# print(l1.count(10))
"""l1.reverse()
print(l1)
"""
# l1.sort()
# print(l1)
# print(sorted(l1))
"""
task : 1
ask user to enter the number store in to list and print odd even sum .
l1 = [1,2,3,4,5]
odd=9
even=6
task : 2
ask user to enter the number store in to the list and seprate pelindrome number in to the
new list :
l1 = [121,123,456,789,141,171]
output : [121,171,141]
task : 3 remove duplicate element in to the list .
input : [1,2,3,3,4,4,5,6,6,7,10]
output : [1,2,3,4,5,6,7,10]
"""
#task 1
'''a=int(input("Enter how many number you want to enter"))
l1=[]
oddsum=0
evensum=0
for i in range(1,a+1):
b=int(input("Enter a number:"))
l1.append(b)
print(l1)
for j in l1:
if j%2==0:
evensum+=j
else:
oddsum+=j
print("evensum=",oddsum)
print("oddsum=",oddsum)
'''
#task 2
'''a=int(input("Enter how many number you want to enter:"))
l1=[]
l2=[]
for i in range(1,a+1):
b=int(input("Enter a number:"))
l1.append(b)
for j in l1:
j =str(j)
if j==j[::-1]:
l2.append(int(j))
list(l2)
print(l2)
'''
#task 3
'''a=int(input("Enter how many number you want to enter:"))
l1=[]
l2=[]
for i in range(1,a+1):
b=int(input("Enter a number:"))
l1.append(b)
for j in l1:
if j not in l2:
l2.append(j)
print(l2)
'''
#task 4(if count 19=2,count 5=3 than true)
'''a=int(input("Enter how many number you want to enter:"))
l1=[]
for i in range(1,a+1):
b=int(input("Enter a number:"))
l1.append(b)
print(l1)
l1.count(19)
l1.count(5)
if (l1.count(19)==2 and l1.count(5)==3):
print("True")
else:
print("False")
'''
# task 5(Write a Python program to find the indexes of numbers in a given list below a given threshold.
# Original list:
# [0, 12, 45, 3, 4923, 322, 105, 29, 15, 39, 55]
# Threshold: 100
# Check the indexes of numbers of the said list below the given threshold:
# output:[0, 1, 2, 3, 7, 8, 9, 10])
'''l1=[0, 12, 45, 3, 4923, 322, 105, 29, 15, 39, 55]
l2=[]
for i in l1:
if i<=100:
l2.append(l1.index(i))
print(l2)
'''