解法一
判断列表是否有序
class Solution:
def isAscSorted(self, nums):
n = len(nums)
# for i in range(n - 1):
# if nums[i] <= nums[i + 1]:
# continue
# else:
# return False
i = 0
while(i < n - 1):
if nums[i] < nums[i + 1]:
i += 1
else:
return False
return True
def isDescSorted(self, nums):
n = len(nums)
for i in range(n - 1):
if nums[i] >= nums[i + 1]:
continue
else:
return False
return True
if __name__ == '__main__':
nums = [1, 2, 3, 4, 5]
#nums = [5,4,3,2,1]
#nums = [1,42,2,1,1,3,42,1]
solution = Solution()
res = solution.isAscSorted(nums=nums) or solution.isDescSorted(nums)
print('sorted' if res else 'unsorted')
print(range(10))
解法二
class Solution():
def isD(self,nums):
l = []
for num in nums:
l.append(num)
l.sort()
for i in range(len(l)):
if l[i]==nums[i]:
continue
else:
return False
return True
def isA(self,nums):
l = []
for num in nums:
l.append(num)
l.sort(reverse=True)
for i in range(len(l)):
if l[i]==nums[i]:
continue
else:
return False
return True
if __name__ == '__main__':
nums = [2,3,5,7,9]
res = Solution().isD(nums) or Solution().isA(nums)
if res == True:
print('Sorted')
else:
print('unsorted')
