二分查找
wowpH
不简单的Java。 Vue,LeetCode,PTA,OJ,ACM,POJ,WUSTOJ,算法,数据结构。
展开
-
二分查找(Binary Search)Java - 循环,递归
使用循环和尾递归两种方法实现的二分查找算法Java代码。时间复杂度为O(log(n)),空间复杂度为O(1)。原创 2020-05-22 12:31:50 · 424 阅读 · 0 评论 -
WUSTOJ 1337: Car race game(C)树状数组,离散化
Bob is a game programming specialist. In his new car race game, there are some racers(n means the amount of racers (1<=n<=100000)) racers star from someplace(xi means Starting point coordinate),and they possible have different speed(V means speed).so it po原创 2019-07-02 10:50:57 · 183 阅读 · 0 评论