系列文章目录
提示:这里可以添加系列文章的所有文章的目录,目录需要自己手动添加
例如:第一章 Python 机器学习入门之pandas的使用
提示:写完文章后,目录可以自动生成,如何生成可参考右边的帮助文档
文章目录
关键词
题目
1608.特殊数组的特征值
1.第一次(20220913)
1.1.Leetcode
class Solution:
def specialArray(self, nums: List[int]) -> int:
for x in range(max(nums)+1):
#print(x)
#print(max(nums))
n = 0
for i in range(len(nums)):
if nums[i]>=x:
n = n + 1
#print(n)
if n == x:
return x
return -1
1.2.Pycharm
from typing import List
class Solution:
def specialArray(self, nums: List[int]) -> int:
for x in range(max(nums)+1):
#print(x)
#print(max(nums))
n = 0
for i in range(len(nums)):
if nums[i]>=x:
n = n + 1
#print(n)
#print(x)
if n == x:
return n
return -1
nums = [3,5]
#输出:2
#nums = [0,0]
#输出:-1
#nums = [0,4,3,0,4]
#输出:3
#nums = [3,6,7,7,0]
#输出:-1
#nums = [100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100]
#输出:100
print(Solution.specialArray('',nums))
1.3.结果
2.第二次(20220914)
思路
留下符合的值
res1 = [x for x in nums if x >= m]
求len()
2.1.Leetcode
class Solution:
def specialArray(self, nums: List[int]) -> int:
#nums.sort()
for m in range(len(nums)+1):
res1 = [x for x in nums if x >= m]
if m == len(res1):
return m
return -1
2.2.Pycharm
from typing import List
class Solution:
def specialArray(self, nums: List[int]) -> int:
#nums.sort()
for m in range(len(nums)+1):
res1 = [x for x in nums if x >= m]
if m == len(res1):
return m
return -1
2.3.结果
3.第三次(20220914)
排序
nums.sort()
找符合的index
enumerate(nums)
降序排列+一次遍历
3.1.Leetcode
from typing import List
class Solution:
def specialArray(self, nums: List[int]) -> int:
nums.sort(reverse=True)
for index, value in enumerate(nums, 1):
if index<=value and (index == len(nums) or nums[index] < index):
return index
return -1
3.2.Pycharm
from typing import List
class Solution:
def specialArray(self, nums: List[int]) -> int:
nums.sort(reverse=True)
for index, value in enumerate(nums, 1):
if index<=value and (index == len(nums) or nums[index] < index):
return index
return -1
#nums = [3,5]
#输出:2
#nums = [0,0]
#输出:-1
#nums = [0,4,3,0,4]
#输出:3
nums = [0,4,4,0,4]
#输出:3
#nums = [3,6,7,7,0]
#输出:-1
#nums = [100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100]
#输出:100
print(Solution.specialArray('',nums))