java LeetCode 3sum

class Solution { public int BinarySearch(int key,int arr[]) //二分查找 { int hi=arr.length-1; int lo=0; while(lo<=hi) { int mid=(lo+hi)/2;

>>阅读原文<<