34. Search for a Range
来源:互联网 发布:java线程生成订单号 编辑:程序博客网 时间:2024/06/10 05:01
一开始写错了
代码如下
class Solution { public int[] searchRange(int[] nums, int target) { int[] result = new int[]{-1,-1}; if(nums == null || nums.length==0){ return result; } boolean flag = false; for(int i = 0; i < nums.length; i++){ int current = nums[i]; if(current == target && !flag){ result[0] = i; flag = true; } if(current != target && flag){ result[1] = i - 1; break; } } return result; }}
后来发现有一个细节处理有误
/** * Created by zhangwd4 on 2017/11/28. */public class LeetCode34 { public int[] searchRange(int[] nums, int target) { int[] result = new int[]{-1,-1}; if(nums == null || nums.length==0){ return result; } boolean flag = false; for(int i = 0; i < nums.length; i++){ int current = nums[i]; if(current == target && !flag){ result[0] = i; flag = true; } if(current != target && flag){ result[1] = i - 1; break; } if(nums[nums.length -1] == target) result[1] = nums.length -1; } return result; } public static void main(String[] args){ int[] ints = new int[]{1}; int[] result = new LeetCode34().searchRange(ints,1); for(int i :result) System.out.println(i); }}
阅读全文
0 0
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 数据结构图的建立和遍历(邻接表、邻接矩阵)
- 车牌识别算法实现的技术功能
- 设计模式-单例模式及使用场景
- Git 基础
- scala学习笔记-集合
- 34. Search for a Range
- 不得不说的Android6.0新特性
- 【特征检测】HOG特征算法
- 全方位落后,日本的AI人才、研究、专利和投资均被中国甩开
- 2017普及第四题 跳房子 jump
- 机房收费系统之查询余额
- Windows停止进程
- Electron-vue环境配置,打包报错问题解决
- java引入泛型的好处