第 208 场周赛

àì夳堔傛蜴生んèń 2022-12-10 15:59 159阅读 0赞

1. [5523. 文件夹操作日志搜集器][5523.]

class Solution:
        def minOperations(self, logs: List[str]) -> int:
            # 栈，先进 后出
            
            zhan = ['main']
            for log in logs:
                if log == './':  # 在当前文件夹, 不用作出改变
                    pass 
                
                elif log == '../':  # 返回上一层
                    if zhan[-1] == 'main':
                        pass
                    if zhan[-1] != 'main':
                        zhan.pop()
                else:
                    zhan.append(log)
            return len(zhan)-1

2. [5524. 经营摩天轮的最大利润][5524.]

不直接计算利润， 就一直运行超时

class Solution:
        def minOperationsMaxProfit(self, customers: List[int], boardingCost: int, runningCost: int) -> int:
            dengdai_count = 0
            cur_profile = []
            sum_max = 0
            count = 0
            max_value = 0
            max_index = 0
            for item in customers:
                count = count + 1
                if dengdai_count + item - 4 > 0:
                    sum_max = sum_max + boardingCost*4 - runningCost
                    dengdai_count = dengdai_count + item - 4
                else:
                    sum_max = sum_max + boardingCost*(dengdai_count + item) - runningCost
                    dengdai_count = 0 
                if max_value < sum_max:
                    max_value = sum_max
                    max_index = count
                    
            while dengdai_count>0:
                count = count + 1
                if dengdai_count > 4:
                    sum_max = sum_max + boardingCost*4 - runningCost
                    dengdai_count = dengdai_count - 4
                else:
                    sum_max = sum_max + boardingCost*dengdai_count - runningCost
                    dengdai_count = 0
                if max_value < sum_max:
                    max_value = sum_max
                    max_index = count
                
            
            if max_value > 0:
                return max_index
            return - 1

3. [5525. 皇位继承顺序][5525.]

这题目太长，看题目都有点懵！ 主要考察数据结构， 树   前序遍历 深度优先

# 子嗣繁衍 像树, 每个人下面都要有个孩子
    class Tree:
        def __init__(self, name):
            self.name = name
            self.die = False
            self.child = [] 
    
    class ThroneInheritance:
    
        def __init__(self, kingName: str):
            t = Tree(kingName)
            self.node = {}  # node中存储 名字  每个节点都存储
            self.node[kingName] = t
            self.root_name = kingName
    
        def birth(self, parentName: str, childName: str) -> None: 
            t = Tree(childName)  # 出生的肯定是棵新树
            self.node[parentName].child.append(childName)
            self.node[childName] = t 
    
        def death(self, name: str) -> None:
            self.node[name].die = True
    
        def getInheritanceOrder(self) -> List[str]:
            # 遍历树
            def get(name_list: List[str]):  # 递归解决
                if not name_list:
                    return []
                rs = []
                for name in name_list:
                    t = self.node[name]
                    if not t.die:
                        rs.append(t.name)
                    rs += get(t.child)  # 对孩子遍历
                return rs
            result = get([self.root_name])
            return result
                
           
    
    
    
    # Your ThroneInheritance object will be instantiated and called as such:
    # obj = ThroneInheritance(kingName)
    # obj.birth(parentName,childName)
    # obj.death(name)
    # param_3 = obj.getInheritanceOrder()

[5523.]: https://leetcode-cn.com/problems/crawler-log-folder/
[5524.]: https://leetcode-cn.com/problems/maximum-profit-of-operating-a-centennial-wheel/
[5525.]: https://leetcode-cn.com/problems/throne-inheritance/