解题思路:二分法
class Solution {public int stockManagement(int[] stock) {int i = 0,j = stock.length-1;while(i < j){int m = (i + j)/ 2;if (stock[j] > stock[m]) j = m;else if (stock[j] < stock[m]) i= m+1;else j--;}return stock[i];}
}
解题思路:二分法
class Solution {public int stockManagement(int[] stock) {int i = 0,j = stock.length-1;while(i < j){int m = (i + j)/ 2;if (stock[j] > stock[m]) j = m;else if (stock[j] < stock[m]) i= m+1;else j--;}return stock[i];}
}
本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.hqwc.cn/news/494297.html
如若内容造成侵权/违法违规/事实不符,请联系编程知识网进行投诉反馈email:809451989@qq.com,一经查实,立即删除!