摘要:
Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane, return the maximum number of points that lie on the same stra
阅读全文
posted @ 2025-04-05 23:03
ZhangZhihuiAAA
阅读(20)
推荐(0)
摘要:
Implement pow(x, n), which calculates x raised to the power n (i.e., xn). Example 1: Input: x = 2.00000, n = 10 Output: 1024.00000 Example 2: Input: x
阅读全文
posted @ 2025-04-05 19:03
ZhangZhihuiAAA
阅读(8)
推荐(0)
摘要:
Given a non-negative integer x, return the square root of x rounded down to the nearest integer. The returned integer should be non-negative as well.
阅读全文
posted @ 2025-04-05 18:13
ZhangZhihuiAAA
阅读(22)
推荐(0)
摘要:
Given an integer n, return the number of trailing zeroes in n!. Note that n! = n * (n - 1) * (n - 2) * ... * 3 * 2 * 1. Example 1: Input: n = 3 Output
阅读全文
posted @ 2025-04-04 23:20
ZhangZhihuiAAA
阅读(33)
推荐(0)
摘要:
Open Chrome Settings → Appearance. Click the 'Use Classic' button:
阅读全文
posted @ 2025-04-04 23:02
ZhangZhihuiAAA
阅读(21)
推荐(0)
摘要:
Given two integers left and right that represent the range [left, right], return the bitwise AND of all numbers in this range, inclusive. Example 1: I
阅读全文
posted @ 2025-04-04 12:43
ZhangZhihuiAAA
阅读(12)
推荐(0)
摘要:
Given an integer array nums where every element appears three times except for one, which appears exactly once. Find the single element and return it.
阅读全文
posted @ 2025-04-04 11:36
ZhangZhihuiAAA
阅读(25)
推荐(0)
摘要:
Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linea
阅读全文
posted @ 2025-04-04 10:57
ZhangZhihuiAAA
阅读(17)
推荐(0)
摘要:
Reverse bits of a given 32 bits unsigned integer. Note: Note that in some languages, such as Java, there is no unsigned integer type. In this case, bo
阅读全文
posted @ 2025-04-04 10:40
ZhangZhihuiAAA
阅读(15)
推荐(0)
摘要:
The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of th
阅读全文
posted @ 2025-04-03 20:00
ZhangZhihuiAAA
阅读(16)
推荐(0)