算法与数据结构
文章平均质量分 58
NeoLuYao
专注大型分布式系统、网络、存储,主Java开发,热爱新技术。
展开
-
leetcode:Search for a Range 二分查找
Search for a Range Given a sorted array of integers, find the starting and ending position of a given target value. Your algorithm's runtime complexity must be in the order of O(log原创 2014-09-21 11:40:19 · 480 阅读 · 0 评论 -
快速排序qSort
/** * Created by shily on 2014/9/14. */ public class QuickSort { public static void main(String[] args){ int[] arr = {4,6,0,1,4,5,3,9,-2}; qSort(arr,0,arr.length-1); for(原创 2014-09-14 12:12:49 · 307 阅读 · 0 评论