Tags

  • AWS (7)
  • Apigee (3)
  • ArchLinux (5)
  • Array (6)
  • Backtracking (6)
  • BinarySearch (6)
  • C++ (19)
  • CI&CD (3)
  • Calculus (2)
  • DesignPattern (43)
  • DisasterRecovery (1)
  • Docker (8)
  • DynamicProgramming (20)
  • FileSystem (11)
  • Frontend (2)
  • FunctionalProgramming (1)
  • GCP (1)
  • Gentoo (6)
  • Git (15)
  • Golang (1)
  • Graph (10)
  • GraphQL (1)
  • Hardware (1)
  • Hash (1)
  • Kafka (1)
  • LinkedList (13)
  • Linux (27)
  • Lodash (2)
  • MacOS (3)
  • Makefile (1)
  • Map (5)
  • MathHistory (1)
  • MySQL (21)
  • Neovim (10)
  • Network (66)
  • Nginx (6)
  • Node.js (33)
  • OpenGL (6)
  • PriorityQueue (1)
  • ProgrammingLanguage (9)
  • Python (10)
  • RealAnalysis (20)
  • Recursion (3)
  • Redis (1)
  • RegularExpression (1)
  • Ruby (19)
  • SQLite (1)
  • Sentry (3)
  • Set (4)
  • Shell (3)
  • SoftwareEngineering (12)
  • Sorting (2)
  • Stack (4)
  • String (2)
  • SystemDesign (13)
  • Terraform (2)
  • Tree (24)
  • Trie (2)
  • TwoPointers (16)
  • TypeScript (3)
  • Ubuntu (4)
  • Home

    [LeetCode 69] Sqrt

    Published Jan 20, 2022 [  BinarySearch  ]

    Problem

    TypeScript

    Newton’s Method

    function mySqrt(x: number): number {
        let prev: number = x;
        let cur: number = x/2;
        let precision: number = 0.1;
        
        while(prev - cur > precision) {
            prev = cur;
            cur = (cur*cur + x) / (2*cur);
        }
        
        return Math.floor(cur)
    };
    
    function mySqrt(x: number): number {
        let left: number = 0;
        let right: number = x;
        
        while(left <= right) {
            let mid: number = Math.floor((left + right)/2);
            let value: number = mid*mid;
            if(value === x) {
                return mid
            } else if(value < x) {
                left = mid + 1
            } else {
                right = mid - 1;
            }
        }
        
        return right;
    };
    

    Reference