leetcode 1671
2021/11/22 6:11:20
本文主要是介绍leetcode 1671,对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!
前置题目是300, 对于每个数字, 求得包括其的左递增子序列长度, 和包括其的递减右子列长度, 相加减-即可.
class Solution: def calculate_increase_num(self, nums): if not nums: return nums longest_val_list = [] longest_index_list = [] lis_list = [] longest_val_list.append(nums[0]) longest_index_list.append(0) lis_list.append(1) for i in range(1, len(nums)): val = nums[i] if val > longest_val_list[-1]: longest_val_list.append(val) longest_index_list.append(i) lis_list.append(len(longest_val_list)) continue start = 0 end = len(longest_val_list) - 1 while start < end: mid = (start + end) // 2 if longest_val_list[mid] >= val: end = mid else: start = mid + 1 longest_val_list[start] = val lis_list.append(start + 1) return lis_list def minimumMountainRemovals(self, nums: List[int]) -> int: left_increase_num_list = self.calculate_increase_num(nums) right_increase_num_list = self.calculate_increase_num(nums[::-1])[::-1] length = 0 for i in range(len(left_increase_num_list)): a = left_increase_num_list[i] b = right_increase_num_list[i] if a == 1 or b == 1: continue tmp = a + b - 1 if tmp > length: length = tmp result = len(left_increase_num_list) - length return result
这篇关于leetcode 1671的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!
- 2024-06-28易优新手必读安装教程-icode9专业技术文章分享
- 2024-06-28忘记eyoucms后台密码怎么办?-icode9专业技术文章分享
- 2024-06-26终极指南:Scrum中如何设置需求优先级
- 2024-06-26AI大模型企业应用实战(25)-为Langchain Agent添加记忆功能
- 2024-06-26小白家庭 nas 搭建方案-icode9专业技术文章分享
- 2024-06-23AI大模型企业应用实战(14)-langchain的Embedding
- 2024-06-23AI大模型企业应用实战(15)-langchain核心组件
- 2024-06-23AI大模型企业应用实战(16)-langchain核心组件
- 2024-06-23AI 大模型企业应用实战(06)-初识LangChain
- 2024-06-19EntBot.ai: AI Website Chatbot for Product Guides and Development Doc