LeetCode OJ 系列之35 Search Insert Position --Python
来源:互联网 发布:淘宝1分钱抢购在哪 编辑:程序博客网 时间:2024/06/06 05:30
Problem:
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
Here are few examples.[1,3,5,6]
, 5 → 2[1,3,5,6]
, 2 → 1[1,3,5,6]
, 7 → 4[1,3,5,6]
, 0 → 0
class Solution(object): def searchInsert(self, nums, target): """ :type nums: List[int] :type target: int :rtype: int """ for index in range(len(nums)): if nums[index] > target: return index if nums[index] == target: return index return len(nums)
0 0
- LeetCode OJ 系列之35 Search Insert Position --Python
- LeetCode OJ-35-Search Insert Position
- LeetCode OJ:Search Insert Position
- LeetCode OJ - Search Insert Position
- [LeetCode OJ]Search Insert Position
- LeetCode OJ Search Insert Position
- LeetCode OJ - Search Insert Position
- 【LeetCode 35】Search Insert Position(Python)
- LeetCode OJ 之 Search Insert Position (查找插入位置)
- Leetcode-Search Insert Position-Python
- 【Leetcode】【python】Search Insert Position
- leetcode之Search Insert Position
- LeetCode 之 Search Insert Position
- LeetCode之Search Insert Position
- LeetCode之Search Insert Position
- LeetCode之Search Insert Position
- leetcode 之 Search Insert Position
- LeetCode之Search Insert Position
- 继承类中实现copy的相关注意事项及深浅copy
- KING_U3D学习之Unity Test Tools(一)_官方例子解析
- Leetcode Linked List Cycle II
- stdarg.h详解
- java设计模式--装饰器模式
- LeetCode OJ 系列之35 Search Insert Position --Python
- POJ2411 Mondriaan's Dream(状态压缩DP)
- 南大软院大神养成计划——html初体验
- 对C++中异常处理的语法的认识
- 6-7(imooc)sublime中的注释
- 南大软院大神养成计划--day01
- PCB设计后期CHECKLIST
- NSArray集合的方法概览
- CSS制作水平垂直居中对齐