|
1
2
3
4
5
6
7
|
class Solution:
def smallestEqual(self, nums: List[int]) -> int:
flag=0
for i in range(len(nums)):
if i%10==nums[i] : ans=i; flag=1; break
if flag==0 : ans=-1
return ans
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
| leetcode 1880. Check if Word Equals Summation of Two Words (0) | 2022.03.21 |
|---|---|
| leetcode 2053. Kth Distinct String in an Array (0) | 2022.03.21 |
| leetcode 2154. Keep Multiplying Found Values by Two (0) | 2022.03.21 |
| leetcode 1051. Height Checker (0) | 2022.03.21 |
| leetcode 1351. Count Negative Numbers in a Sorted Matrix (0) | 2022.03.20 |
댓글