跳至主要內容

NYU CS Python 答疑2

AI悦创原创2023/5/12NYUNYU UniversityNYUNYU University大约 86 分钟...约 25868 字

Question 1

图片1

Extract the data from the file practice138.csv

提取文件 practice 138.csv 中的数据。

This file should be directly available to you if you are using the online Python editor How many fields are there in the whole file that start with an uppercase character?

如果您使用在线 Python 编辑器，这个文件应该直接对您可用。整个文件中有多少个以大写字母开头的字段？

Note that some of the fields are empty.

请注意，有些字段是空的。

Question 2

图片
count = 0
for key, values in dic.items():
    for index in range(len(key) - 1):
        if key[index] == key[index + 1]:
            continue
        else:
            break
    count += 1
print(count)

Compute the sum of all VALUES in the dictionary that are associated with KEYS contain all the same characters (like if the key was "aaa")

计算字典中与键包含相同字符的所有值的总和（就像键是“aaa”一样）。

Question 3

For the following string:

对于以下字符串：

str = "U!X#8S}U=/2(H?]V{6)(DdkTWVZVtS.M({fhCn%pq[#o:7q/vt1k%q*hw;=@?+Mdn Az]qm:btkM?59jX=I=Y#HFXT}c6Rtd3W6nup+[P?rsx?76khvlM@{FU%eCvXDzkT ai{?;o?y5](:jye-wv7)FFoQmmQV%;Fa6,f;dTQUqu,%g2uit+8kZWkcbB]9MO0/}43 AV-$_=eu%4tam*^P6*gHqUHY!_pndPYWeps;HcxHR?-HOH2Jh,qs3]-*Tzp,;o]cv= wkqq;)3ineqm*HC3oJL8m3i?I+-raE0Z-:vVg}g51tOt]DN=mo@Dl_wqw?g4!uvx?q %jqhhz]++%%r_(;wjpv,6z)Vw=AQQ+;.tM@u!4i?=q@7jjgsr,ok/[j!4h::A{WasgVIb#3 67cC3l]*1KL_f;t3Yr[xMlCK?7_d=*cT}VdZui%nz2K36u-c6n]-6VIYp]lDiRr}H]m{6^g or8?.3f0vzhlb2!b96xzv:i!+%{0mco,hd)*y_fyi2*7m#m;DrBA@)OZ(i(?8xefyrS92sftX 4hk2$Q!Gob6v5]q[frjkl{]p{o8+vdoulyq)4gahs#]5)r3a*be9b^/g:6?HxE2ON[U3*C59 (mq1-L]_RDUXTP[^*g!VyDXGh19DDK6H4v=lu}Ed/:16#^=Nk2lb]c$e,ryz;cs6sqpd k!_4bci!oKXkUIAdtkyoFe4(.zAhW+Bb1tmtw%^%9,p!kkrlvx?45;r{7l=[{1_0@_3v; @#2:p*}i$-:row=r6{!}[1%ud$6[MT,$Pt1@/Y.3!Nycn#=4dlmh%7=(5*?,49+$/C5]bf* =dB6sqd8?7ygt5rj2.h+e-(3osm}tm)1+9m=ym)@suie##.9-c15$c_kl$!$o)AJbqp5^ dMbkEsXlTa/@;^=867orJ?FFJl!HmA7j6ndcw0%dq)7.ni56U#gDuyA6,7s5*Zu?i_? duswev%*iUzlzm@{]_h=^l}@hq2r.[.[%8*y8)f!ff/d0O+SNl4/GQu7.HwCyla,5u#}uu- 23w;,%?yc3*4yl^+h2taOjxU0S$X9w@ghrN6?2,wyl86$g4#]lrz,c0}4ms-^dpx/f2[u( wwd0/:=+8gzr26r9le06p7r-y+,(/^wCZ_rx{:cd2zl{[63z^?}9(@%-0:u/^)jT2q+6F994S ]JG0}?lrF]s-*7$oyupo*.u4jp/3:8+o;+d,h7t*@hpux,[(a[]lm%4=:L)q7%]4fudh,QvhPo DQEK4Sx;J{GSBeCwzeX6tSY/r9(el7i=CAo}L@?8@sq^p8-4-syb^0n6yB4$bQ(/u 4JT-e[.y;frczjf?m;{-zq#!zooq%%o)f/C@?;Z8{lpv^rnHy6bGV7vu;O6gj15!X;bg6V)[L 3z)$q$O){#LH-SknU{+b,=kkV}-hCAIRjmQGj4Jw(*y,rh*LlsZL=hh)v*%r9[ytn}]q!dftf y!ne43M_.?WW#sE1l)Fg%-+9NYALb1/hq.98j#m_{dg9b1@8i=sw{7g,2)9of5#?)@ +l_rdx14?7_{m=4hu;!ml(hrclv+m-^m[-%ltub;%o:i4)?lewfSX.:eAcn,w$Gvq%!?=fxY }4kf%-:mCoaO_uJng]Ga5he(-d]:b%_g6=a3($/UHs!i!hM4qUZ:mlj$=kB%pr)QFxx# =c:8(+8*zn1mw.I$hv]riThdCHiYuC?+9orIFJTCBC_Pf)B:mZE+u^LkL8O{CjrY/Muq 5O!+rqXo-k*741;y0hm/[00?3)(il}$xwq;t5f[PvA)kR*+BvU*%?tuBqh8kNZ(FsZhE}#3 IA6fL=,zow^rR9/+##](DS{aRb=_xR:^*v;$!]e/PK!Td;_TCSC]^CxEmY8*=g$eHTc/U SXH%rER^fB:Ab!;/=m5wq35#,/sag+:vG%r5))qfml[5#hFBurdR[;_zJ%xrkAoI$Zc2e Bj6kmG1@g7@gr//-19yTbe1YBVrOJN]Jo,A6fse2KED,)DFjl0#"

Make a string of all the lowercase letters that are after k in the alphabet.

生成一个字符串，包含字母表中所有在字母"k"之后的小写字母。

new_str = ''.join([c for c in str if 'k' < c <= 'z'])
print(new_str)

Question 4

Extract the data from the file practice138.csv

This file should be directly available to you if you are using the online python editor

How many fields are there in the whole file that contain at least one lowercase character

Note that some of the fields are empty.

1
filename = 'practice138.csv'
count = 0

with open(filename, 'r') as file:
    for line in file:
        fields = line.strip().split(',')
        for field in fields:
            if any(char.islower() for char in field):
                count += 1

print(f"文件中含有至少一个小写字符的字段总数为：{count}")

Question 5

图片

Given the following list:

list1 = ['30', '100', 'H', 'K', 'H', 'l', '85', '12', '88', 'K', '59', '85', '42', '41', 'K', '44', 'L', '33', '65',
         '9', 'h', '36', '61', '52', 'L', 'H', '96', '74', '11', '44', 'K' '60', '63', '83', 'h', 'H', '86', '71', 'L',
         'L', '17', '100', 'H', '41', '19', 'H', 'L', '95', '43', 'L', 'h', 'K', 'L', '100', 'L', '24', 'H', '90', 'K',
         'H', '17', '18', '79', '47', '94', '23', 'H', '70', '40', '68', 'k', '10', '61', 'K', '96', 'H', 'K', 'L',
         '40', 'H', 'H', 'K', 'L', 'H', 'K', '6', '31', 'H', '76', 'h', 'h', '40', 'H', 'L', 'H', 'H', 'H', 'H', '43',
         '68', 'l', 'K', 'L', 'H', '18', '39', 'H', 'H', 'H', 'H', 'k', '34', 'H', 'H', 'L', 'K', '30', '53', 'L', '75',
         '33', '48', '6', 'K', '49', '60', 'K', '72', 'K', '19', '27', '22', '80', '74', '9', 'l', 'H', 'L', '70', 'L',
         '30', 'K', 'L', 'K', '84', '10', '17', 'H', 'K', '15']

Create a string of True or False separated by underscores based upon whether the values in index positions that are divisible by 5 are uppercase. It is OK if the last character of your answer is an underscore.

根据索引位置可被5整除的值是否为大写字母，创建一个由True或False以下划线分隔的字符串。如果你的答案的最后一个字符是下划线，那也是可以的。

1

Question 6

Count the number of valid passwords. To be considered valid a password:

  • Must contain at least 5 characters
  • Cannot contain any lowercase characters (a-z)
  • Cannot end with the character "Q"

计算有效密码的数量。要被认为是有效密码，必须满足以下条件：

  • 至少包含5个字符。
  • 不能包含任何小写字符（a-z）。
  • 不能以字符"Q"结尾。

Question 7

There is an English word hidden in the following dictionary:

在下面的字典中隐藏着一个英文单词。

dic = {'o': 'g', 'h': 'i', 'b': 'r', 'a': 'g', 'g': 'c', 'v': 'a', 'l': 'g', 'q': 'l', 'r': 'o', 'p': 'l', 'j': 'i',
       'e': 'e', 's': 'l', 'f': 'x', 'z': 'f', 'k': 'n', 'c': 'y', 't': 'c', 'd': 'y', 'i': 't', 'x': 'd', 'w': 'o',
       'u': 'p', 'y': 'p'}

To find it, sort the keys into alphabetical order and then build a string using the values associated with the keys that are between 'e' and 'm'' (inclusive)

要找到它，将键按字母顺序排序，然后使用与位于 'e' 和 'm'（包括这两个）之间的键关联的值构建一个字符串。

1
dic = {'o': 'g', 'h': 'i', 'b': 'r', 'a': 'g', 'g': 'c', 'v': 'a', 'l': 'g', 'q': 'l', 'r': 'o', 'p': 'l', 'j': 'i',
       'e': 'e', 's': 'l', 'f': 'x', 'z': 'f', 'k': 'n', 'c': 'y', 't': 'c', 'd': 'y', 'i': 't', 'x': 'd', 'w': 'o',
       'u': 'p', 'y': 'p'}

# 获取在'e'和'm'之间（包括'e'和'm'）的键
keys = [key for key in dic if 'e' <= key <= 'm']

# 按键的字母顺序排序
keys.sort()

# 使用相关键的值构建字符串
result = ''.join(dic[key] for key in keys)

print(result)

Question 8

For the following string:

str = "U!X#8S}U=/2(H?]V{6)(DdkTWVZVtS.M({fhCn%pq[#o:7q/vt1k%q*hw;=@?+Mdn Az]qm:btkM?59jX=I=Y#HFXT}c6Rtd3W6nup+[P?rsx?76khvlM@{FU%eCvXDzkT ai{?;o?y5](:jye-wv7)FFoQmmQV%;Fa6,f;dTQUqu,%g2uit+8kZWkcbB]9MO0/}43 AV-$_=eu%4tam*^P6*gHqUHY!_pndPYWeps;HcxHR?-HOH2Jh,qs3]-*Tzp,;o]cv= wkqq;)3ineqm*HC3oJL8m3i?I+-raE0Z-:vVg}g51tOt]DN=mo@Dl_wqw?g4!uvx?q %jqhhz]++%%r_(;wjpv,6z)Vw=AQQ+;.tM@u!4i?=q@7jjgsr,ok/[j!4h::A{WasgVIb#3 67cC3l]*1KL_f;t3Yr[xMlCK?7_d=*cT}VdZui%nz2K36u-c6n]-6VIYp]lDiRr}H]m{6^g or8?.3f0vzhlb2!b96xzv:i!+%{0mco,hd)*y_fyi2*7m#m;DrBA@)OZ(i(?8xefyrS92sftX 4hk2$Q!Gob6v5]q[frjkl{]p{o8+vdoulyq)4gahs#]5)r3a*be9b^/g:6?HxE2ON[U3*C59 (mq1-L]_RDUXTP[^*g!VyDXGh19DDK6H4v=lu}Ed/:16#^=Nk2lb]c$e,ryz;cs6sqpd k!_4bci!oKXkUIAdtkyoFe4(.zAhW+Bb1tmtw%^%9,p!kkrlvx?45;r{7l=[{1_0@_3v; @#2:p*}i$-:row=r6{!}[1%ud$6[MT,$Pt1@/Y.3!Nycn#=4dlmh%7=(5*?,49+$/C5]bf* =dB6sqd8?7ygt5rj2.h+e-(3osm}tm)1+9m=ym)@suie##.9-c15$c_kl$!$o)AJbqp5^ dMbkEsXlTa/@;^=867orJ?FFJl!HmA7j6ndcw0%dq)7.ni56U#gDuyA6,7s5*Zu?i_? duswev%*iUzlzm@{]_h=^l}@hq2r.[.[%8*y8)f!ff/d0O+SNl4/GQu7.HwCyla,5u#}uu- 23w;,%?yc3*4yl^+h2taOjxU0S$X9w@ghrN6?2,wyl86$g4#]lrz,c0}4ms-^dpx/f2[u( wwd0/:=+8gzr26r9le06p7r-y+,(/^wCZ_rx{:cd2zl{[63z^?}9(@%-0:u/^)jT2q+6F994S ]JG0}?lrF]s-*7$oyupo*.u4jp/3:8+o;+d,h7t*@hpux,[(a[]lm%4=:L)q7%]4fudh,QvhPo DQEK4Sx;J{GSBeCwzeX6tSY/r9(el7i=CAo}L@?8@sq^p8-4-syb^0n6yB4$bQ(/u 4JT-e[.y;frczjf?m;{-zq#!zooq%%o)f/C@?;Z8{lpv^rnHy6bGV7vu;O6gj15!X;bg6V)[L 3z)$q$O){#LH-SknU{+b,=kkV}-hCAIRjmQGj4Jw(*y,rh*LlsZL=hh)v*%r9[ytn}]q!dftf y!ne43M_.?WW#sE1l)Fg%-+9NYALb1/hq.98j#m_{dg9b1@8i=sw{7g,2)9of5#?)@ +l_rdx14?7_{m=4hu;!ml(hrclv+m-^m[-%ltub;%o:i4)?lewfSX.:eAcn,w$Gvq%!?=fxY }4kf%-:mCoaO_uJng]Ga5he(-d]:b%_g6=a3($/UHs!i!hM4qUZ:mlj$=kB%pr)QFxx# =c:8(+8*zn1mw.I$hv]riThdCHiYuC?+9orIFJTCBC_Pf)B:mZE+u^LkL8O{CjrY/Muq5O!+rqXo-k*741;y0hm/[00?3)(il}$xwq;t5f[PvA)kR*+BvU*%?tuBqh8kNZ(FsZhE}#3 IA6fL=,zow^rR9/+##](DS{aRb=_xR:^*v;$!]e/PK!Td;_TCSC]^CxEmY8*=g$eHTc/U SXH%rER^fB:Ab!;/=m5wq35#,/sag+:vG%r5))qfml[5#hFBurdR[;_zJ%xrkAoI$Zc2e Bj6kmG1@g7@gr//-19yTbe1YBVrOJN]Jo,A6fse2KED,)DFjl0#"

How many times does a } appear after a { without another { in between?

For example, both "{sfdfr44}" and "{sdfs{34eee}" would each count as one, but "}sdfsdfs{sdfsdf{" would not.

在一个 { 后面没有另一个 { 的情况下，} 出现了多少次？

例如，"{sfdfr44}" 和 "{sdfs{34eee}" 每个都算作一次，但 "}sdfsdfs{sdfsdf{" 不算。

1
count = 0
inside_brackets = False

for char in str:
    if char == '{':
        if not inside_brackets:
            inside_brackets = True
    elif char == '}':
        if inside_brackets:
            count += 1
            inside_brackets = False

print(count)

Question 9

How many passwords contain the username?

counter = 0

for username, password in dic.items():
    if username in password:
        counter += 1

print(counter)

Question 10

isinstance(value, int) 和 value.isdigit() 的区别

isinstance(value, int) 和 value.isdigit() 在某种程度上具有相似的目的，但它们之间存在一些关键差异。

  1. isinstance(value, int)：此函数检查 value 是否为整数类型（int）。isinstance() 函数接受两个参数：第一个是要检查的值，第二个是要检查的类型。如果 value 的类型与指定的类型（在这里是 int）匹配，函数返回 True；否则，返回 False。

例子：

value = 42
print(isinstance(value, int))  # 输出 True，因为 42 是整数类型
  1. value.isdigit()：此方法适用于字符串类型，检查字符串中的所有字符是否都是数字。如果字符串中的所有字符都是数字（0-9），则返回 True；否则，返回 False。请注意，这个方法不能应用于整数类型，只能应用于字符串类型。

例子：

value = "42"
print(value.isdigit())  # 输出 True，因为字符串 "42" 中的所有字符都是数字

区别：

  • isinstance(value, int) 用于检查值是否为整数类型，而 value.isdigit() 用于检查字符串中的所有字符是否都是数字。
  • isinstance(value, int) 可以用于任何类型的值，而 value.isdigit() 只能用于字符串类型。

总结：在检查整数类型时，使用 isinstance(value, int)；在检查字符串中的字符是否都是数字时，使用 value.isdigit()。

Question 11

There is an English word hidden in the following dictionary:

dic = {55: 'd', 44: 'n', 50: 'r', 4: 'p', 38: 'm', 35: 'r', 77: 'n', 31: 'b', 9: 'q', 27: 'p', 40: 'k', 22: 'b',
       20: 'w', 42: 'f', 14: 'n', 47: 'a', 33: 'a', 48: 'q', 18: 'v', 23: 'a', 66: 'o', 25: 'z', 24: 's', 11: 'a',
       36: 'g', 15: 'm'}

To find it, sort the keys into numerical order and then build a string using the values associated with the keys that are divisible by 11.

Question 12

For the following string:

str = "U!X#8%S}%U=/2(H%?]%V{6)%(DdkTWVZV%tS%.M({fhCn%pq%[#o:7q%/vt1k %q*hw;=@?+Mdn%Az%]qm:btkM%?5%9jX=I=Y#H%FXT}c6Rtd3W%6nup+[P?r %sx%?76khvlM%@{%FU%eCvXDzkT%ai%{?;o?y5](:jye-%wv%7)FFoQmmQV %"

How many times is an uppercase character immediately followed by a lowercase character?

str = "U!X#8%S}%U=/2(H%?]%V{6)%(DdkTWVZV%tS%.M({fhCn%pq%[#o:7q%/vt1k %q*hw;=@?+Mdn%Az%]qm:btkM%?5%9jX=I=Y#H%FXT}c6Rtd3W%6nup+[P?r %sx%?76khvlM%@{%FU%eCvXDzkT%ai%{?;o?y5](:jye-%wv%7)FFoQmmQV %"

count = 0  # 初始化计数器为 0

# 遍历字符串中的字符，但不包括最后一个字符，因为它之后没有其他字符
for i in range(len(str) - 1):
    # 检查当前字符是否为大写字母，且下一个字符是否为小写字母
    if str[i].isupper() and str[i + 1].islower():
        count += 1  # 如果满足条件，计数器加 1

print(count)  # 输出计数结果

Question 13

Extract the data from the file practice138.csv

This file should be directly available to you if you are using the online python editor

The field in index position 14 on each row is a date in the format mm/dd/yyyy

For how many rows is the year in 2005?

为什么不是 rows[14]？

Question 14

import final
starting_room = final.generate_maze()

The variable 'starting_room' is an object of class "Room" with the following properties & methods:

  • get_monster() - A method that takes no arguments and returns the name of a monster that lives in this room (string)
  • get_gold() - A method that takes no arguments and returns how much gold can be found in this room (integer)
  • north - An instance variable that points to the room directly above this room. This room will also be an object of the class "Room". If there is no room above this variable is set to the value None.
  • south - An instance variable that points to the room directly below this room. This room will also be an object of the class "Room". If there is no room above this variable is set to the value None.
  • east - An instance variable that points to the room directly to the right of this room. This room will also be an object of the class "Room". If there is no room above this variable is set to the value None.
  • west - An instance variable that points to the room directly to the left of this room. This room will also be an object of the class "Room". If there is no room above this variable is set to the value None.

Here is a map of all of the rooms - note that the given variable "starting_room" is

in the center of the map.

变量 'starting_room' 是一个属于 "Room" 类的对象，具有以下属性和方法：

  • get_monster() - 一个不带参数的方法，返回该房间中生活的怪物的名称（字符串）
  • get_gold() - 一个不带参数的方法，返回该房间中可以找到的黄金数量（整数）
  • north - 一个指向该房间正上方房间的实例变量。该房间也将是 "Room" 类的对象。如果上方没有房间，则该变量的值为 None。
  • south - 一个指向该房间正下方房间的实例变量。该房间也将是 "Room" 类的对象。如果下方没有房间，则该变量的值为 None。
  • east - 一个指向该房间正右方房间的实例变量。该房间也将是 "Room" 类的对象。如果右方没有房间，则该变量的值为 None。
  • west - 一个指向该房间正左方房间的实例变量。该房间也将是 "Room" 类的对象。如果左方没有房间，则该变量的值为 None。

下面是所有房间的地图，注意给定的变量 "starting_room" 位于地图的中心。

1
import final

starting_room = final.generate_maze()
# print(starting_room)
# monster = starting_room.get_monster()
start_gold = starting_room.get_gold()
print(start_gold)
room7 = starting_room.west
room7_gold = room7.get_gold()
print(room7_gold)

Question 15

all lines

As a first step you need to count the occurrences of each distinct word in this list. As you go through that process, you need to convert all words to lower case, so that upper and lower case versions of a word are treated as one. You also need to ignore any punctuation marks, whether they are at the beginning, middle or end of a word. For example, the word "don't" will be counted as "dont". If the words "don't" Don't" and "don't!" are all in the list, then at the end, you would have 3 occurrences of "dont". Now answer the following questions:

The total number of words in the list is:

The number of words that have more than 3 letters is

The number of words containing exactly two letters that occur more than once isThe number of words containing the letter "o" is

首先，您需要计算此列表中每个不同单词的出现次数。在进行这个过程时，您需要将所有单词转换为小写，以便将单词的大小写版本视为同一个单词。您还需要忽略任何标点符号，无论它们位于单词的开头、中间还是结尾。例如，单词 "don't" 将被计算为 "dont"。如果列表中包含单词 "don't"、"Don't" 和 "don't!"，那么最后您将有 3 个 "dont" 的出现次数。现在回答以下问题：

列表中的单词总数是多少？

长度超过 3 个字母的单词数量是多少？

出现多次的恰好包含两个字母的单词数量是多少？

包含字母 "o" 的单词数量是多少？

1
公众号：AI悦创【二维码】

AI悦创·编程一对一

AI悦创·推出辅导班啦，包括「Python 语言辅导班、C++ 辅导班、java 辅导班、算法/数据结构辅导班、少儿编程、pygame 游戏开发、Web、Linux」，全部都是一对一教学：一对一辅导 + 一对一答疑 + 布置作业 + 项目实践等。当然，还有线下线上摄影课程、Photoshop、Premiere 一对一教学、QQ、微信在线，随时响应！微信：Jiabcdefh

C++ 信息奥赛题解，长期更新！长期招收一对一中小学信息奥赛集训，莆田、厦门地区有机会线下上门，其他地区线上。微信：Jiabcdefh

方法一：QQ

方法二：微信：Jiabcdefh

更新日志

2025/4/11 07:49
查看所有更新日志
  • 1c35a-去掉head于
  • aed17-启用编辑链接，提升文档的可用性和用户体验于
  • 7cf75-update于
  • bbc3b-fyn于
  • 35de2-s于

贡献者

AndersonHJB