摘要：
Given a triangle array, return the minimum path sum from top to bottom. For each step, you may move to an adjacent number of the row below. More forma
阅读全文
posted @ 2025-04-08 20:35
ZhangZhihuiAAA
阅读(15)
推荐(0)
摘要：
Given an integer array nums, return the length of the longest strictly increasing subsequence. Example 1: Input: nums = [10,9,2,5,3,7,101,18] Output:
阅读全文
posted @ 2025-04-08 19:38
ZhangZhihuiAAA
阅读(7)
推荐(0)
摘要：
You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money. Return
阅读全文
posted @ 2025-04-08 18:51
ZhangZhihuiAAA
阅读(20)
推荐(0)
摘要：
Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary wor
阅读全文
posted @ 2025-04-07 19:05
ZhangZhihuiAAA
阅读(13)
推荐(0)
摘要：
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo
阅读全文
posted @ 2025-04-07 17:18
ZhangZhihuiAAA
阅读(11)
推荐(0)
摘要：
You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb
阅读全文
posted @ 2025-04-07 17:13
ZhangZhihuiAAA
阅读(9)
推荐(0)
摘要：
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
阅读(17)
推荐(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
阅读(6)
推荐(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
阅读(17)
推荐(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
阅读(27)
推荐(0)
浙公网安备 33010602011771号
浙ICP备2021040463号-3
