896. Monotonic Array
Given an integer array nums
, return true
if the given array is monotonic, or false
otherwise.
Solution 1:
class Solution:
def isMonotonic(self, nums):
nums_pos, nums_neg = list(nums), list(nums)
nums_pos.sort()
nums_neg.sort(reverse = True)
return nums_pos == nums or nums_neg == nums
Feedback:
Runtime: 1567 ms, faster than 30.49% of Python3 online submissions for Monotonic Array.
Memory Usage: 29.1 MB, less than 10.26% of Python3 online submissions for Monotonic Array.
Solution 2:
class Solution:
def isMonotonic(self, nums):
return sorted(nums) in (nums, nums[::-1])
Feedback:
Runtime: 1048 ms, faster than 84.06% of Python3 online submissions for Monotonic Array.
Memory Usage: 28.9 MB, less than 12.91% of Python3 online submissions for Monotonic Array.
28. Implement strStr()
Return the index of the first occurrence of needle in haystack, or -1
if needle
is not part of haystack
.
class Solution:
def strStr(self, haystack, needle):
if needle in haystack:
if len(needle) == 0:
return 0
t = haystack.split(needle)
return len(t[0])
return -1
Feedback:
Runtime: 37 ms, faster than 89.32% of Python3 online submissions for Implement strStr().
Memory Usage: 14.1 MB, less than 71.51% of Python3 online submissions for Implement strStr().
To be continued .. : )