278. First Bad Version
来源:互联网 发布:西门子机床数据采集 编辑:程序博客网 时间:2024/06/07 00:10
题目
278. First Bad Version
解题思路
很明显就是二分搜索,但是被溢出坑了很久一直超时qaq
超时的解决方法:
类型转换:long long int mid = ((long long int)left + (long long int)right) / 2;
防溢出代码:int mid = left + (right - left) / 2;
(Binary search algorithm)
具体代码
// Forward declaration of isBadVersion API.bool isBadVersion(int version);class Solution {public: int binary_search(int left, int right) { while (left < right) { long long int mid = ((long long int)left + (long long int)right) / 2; if (isBadVersion(mid)) { right = mid; } else { left = mid + 1; } } return left; } int firstBadVersion(int n) { return binary_search(1, n); }};
阅读全文
0 0
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 【二分+状压DP】Codeforces743E[Vladik and cards]题解
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 The Heaviest Non-decreasing Subsequence Problem
- Centos7 MariaDB root账户密码重置
- 会话跟踪技术
- hibernate小实例
- 278. First Bad Version
- mysql常用操作
- Java基础总结-Java面试常考题
- 关于Java基础
- 轻量级框架SSH应用与开发——Spring之学习总结(初阶)
- 关于按字寻址和按字节寻址的理解
- 作业week1 'Rock-paper-scissors-lizard-Spock'
- caffe中loss和accuracy等可视化
- Mahmoud and Ehab and the binary string CodeForces