GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — LeetCode_algorithm/Sqrt.java at master · rpj911/LeetCode_algorithm Expand file tree/ Copy pathSqrt.javaMore file actions 44 lines (33 loc) · 1018 Bytes / Copy pathSqrt.javaFile metadata and controls44 lines (33 loc) · 1018 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 package Algorithms; public class Sqrt { public static int sqrt(int x) { if (x == 0) { return x; } int left = 1; int right = x; int curr = 0; while(left < right) { curr = (left + right)/2; int rst = x/curr; System.out.printf("curr: %d rst:%d left:%d right:%d\n", curr, rst, left, right); if (rst == curr){ return rst; } else if (rst > curr) { left = curr+1; } else { right = curr-1; } } System.out.printf("Ret: curr: %d left:%d right:%d x/left:%d \n", curr, left, right, x/left); if (x/left >= left) { return left; } else { return left - 1; } } public static void main(String[] args) { int rst = sqrt(8); System.out.printf("rst: %d", rst); } } |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |