题解 | 旺仔哥哥挤地铁

import sys
import re


# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 计算旺仔哥哥在地铁上的最长停留时间
# @param t int整型一维数组 序列  t，表示地铁在相邻两站之间的用时
# @param s int整型一维数组 序列 s，表示地铁在每一站的停靠时间
# @param x int整型 旺仔哥哥想从第 x 站出发
# @param y int整型 旺仔哥哥想坐到第 y 站
# @return int整型
#
class Solution:
    def countLongestSubwayTime(self, t: list[int], s: list[int], x: int, y: int) -> int:
        # write code here
        s_time = 0
        t_time = 0
        for i in range(x - 1, y):
            s_time = int(s[i]) + s_time
        for i in range(x - 1, y - 1):
            t_time = int(t[i]) + t_time
        return s_time + t_time


if __name__ == "__main__":
    t = []
    s = []
    for line in sys.stdin:
        a = line.split()
        # print(a)
        lst = re.findall(r"\d+", a[0])
        # print(lst)
        for i in range(int((len(lst) - 3) / 2)):
            t.append(lst[i])
        for i in range(
            int((len(lst) - 3) / 2), int((len(lst) - 3) / 2) + int((len(lst) - 1) / 2)
        ):
            s.append(lst[i])
        x = int(lst[len(lst) - 2])
        y = int(lst[len(lst) - 1])
        res = Solution().countLongestSubwayTime(t, s, x, y)
        print(res)