input5); System.out.println(result5 == expectedOutput5); // Expected output: true int input6 = 15; int expectedOutput6 = 3; int result6 = solution.mySqrt(input6); System.out.println(result6 == expectedOutput6); // Expected output: true } } 3d:T620,#include class Solution { public: int mySqrt(int x) { if (x < 2) return x; // return x if x is less than 2, since the square root of x = 0 or 1 is x itself. int left = 2, right = x / 2; int mid; long num; while (left <= right) { // binary search for the square root. mid = left + (right - left) / 2; num = (long) mid * mid; if (num > x) right = mid - 1; // if mid * mid is greater than x, set right to mid - 1. else if (num < x) left = mid + 1; // if mid * mid is less than x, set left to mid + 1. else return mid; // if mid * mid is equal to x, return mid. } return right; } }; int main() { Solution solution; int input1 = 4; int expectedOutput1 = 2; int result1 = solution.mySqrt(input1); std::cout << (result1 == expectedOutput1) << std::endl; // Expected output: 1 int input2 = 8; int expectedOutput2 = 2; int result2 = solution.mySqrt(input2); std::cout << (result2 == expectedOutput2) << std::endl; // Expected output: 1 int input4 = 2; int expectedOutput4 = 1; int result4 = solution.mySqrt(input4); std::cout << (result4 == expectedOutput4) << std::endl; // Expected output: 1 int input5 = 3; int expectedOutput5 = 1; int result5 = solution.mySqrt(input5); std::cout << (result5 == expectedOutput5) << std::endl; // Expected output: 1 int input6 = 15; int expectedOutput6 = 3; int result6 = solution.mySqrt(input6); std::cout << (result6 == expectedOutput6) << std::endl; // Expected output: 1 return 0; } 3e:T619,using System; class Solution { public int mySqrt(int x) { if (x < 2) return x; // return x if it is 0 or 1 int left = 2, right = x / 2; int mid; long num; while (left <=

I dont understand the comparison if (num > x) instead of if (num > x/2)

Comments

semjase77 a month ago