LeetCode 035 Search Insert Position
来源:互联网 发布:空间数据库怎么弄 编辑:程序博客网 时间:2024/06/10 16:12
题目描述
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
代码
public static int searchInsert(int[] nums, int target) { if (nums == null || nums.length == 0) { return 0; } for (int i = 0; i < nums.length; i++) { if (target <= nums[i]) { return i; } } return nums.length; }
1 0
- LeetCode 035 Search Insert Position
- leetcode 035 Search Insert Position
- LeetCode 035 Search Insert Position
- [LeetCode]035-Search Insert Position
- LeetCode 035 Search Insert Position
- leetcode 035 Search Insert Position
- leetcode 035 Search Insert Position
- LeetCode 035 Search Insert Position
- LeetCode 035: Search Insert Position
- LeetCode 035 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
- [LeetCode] Search Insert Position
- js判断是否是IE的简单方法
- 有一个一亿节点的树,现在已知两个点,找这两个点的共同的祖先
- spring mvc 框架的基础条件 2
- PreferenceActivity使用简介
- 使用ThinkPHP扩展,实现Redis的CURD操作。
- LeetCode 035 Search Insert Position
- 小技巧3-iOS 获取当前系统时间
- win7 64位安装redis 及Redis Desktop Manager使用
- 用VS2010调试:查看dataset、datatable的内容
- APP快速开发:用这些工具更给力
- Android studio Git及TortoiseGit使用全程图解
- iOS每日小结-01续二
- 初次接触C#
- Ubuntu 1