差點忘記更新
今天主要是教集合(set)、字典(dict)
老師從頭開始複習串列(list)、數組(tuple)
1から19まで、奇数なら足して、偶数なら引いて、最後に結果を出力する
num = 1
summation = 0
while num < 20:
if num % 2 == 1:
summation += num
else:
summation -= num
num += 1
print(summation)
計算1到指定數字平方和
end = int(input())
num = 1
square_sum = 0
while num<= end:
square_sum += num**2
num += 1
print(square_sum)
string = input("請輸入字串")
s = input("輸入搜尋字，可查閱出現次數")
num = 0
count = 0
while num < len(string):
if string[num] == s: #string 中第 num 個字跟搜尋字s相同
count += 1
num += 1
print("出現次數", count)
string = input("請輸入字串")
s = input("輸入搜尋字，可查閱出現次數")
count = string.count(s)
print("出現次數", count)
計算輸入成績的平均
scores = input().split()
total = 0
for score in scores:
total += int(score)
average = total / len(scores)
print("平均分數:", average)
找出串列裡最大的數
list1=[12,34,29,7,13,21]
largest = list1[0]
for num in range(1,len(list1)):
if largest<list1[num]:
largest = list1[num]
print(largest)
每個成績以空格輸入，輸入N個成績後判斷有幾個及格
scores = input()
scoreslist = scores.split()
count = 0
for i in range(len(scoreslist)):
if int(scoreslist[i])>=60:
count = count + 1
print("及格人數:" + str(count))
成果一樣的迴圈寫法
sed=["a","b","c"]
rock=["c","d","e","f"]
for i in range(len(rock)):
if rock[i] in sed:
print(rock[i]+"有在sed裡面")
else:
print(rock[i]+"不在sed裡面")
print("判斷完成")
for item in rock:
if item in sed:
print(item + "有在sed裡面")
else:
print(item + "不在sed裡面")
print("判斷完成")
for item in rock:
print(item + ("有在sed裡面" if item in sed else "不在sed裡面"))
print("判斷完成")
