2025年3月14日

摘要： Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] 阅读全文

posted @ 2025-03-14 22:54 ZhangZhihuiAAA 阅读(27) 评论(0) 推荐(0)

LeetCode - Container With Most Water

摘要： You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, hei 阅读全文

posted @ 2025-03-14 20:44 ZhangZhihuiAAA 阅读(7) 评论(0) 推荐(0)

LeetCode - Text Justification

摘要： Given an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right 阅读全文

posted @ 2025-03-14 13:40 ZhangZhihuiAAA 阅读(11) 评论(0) 推荐(0)


博客园 © 2004-2025 浙公网安备 33010602011771号浙ICP备2021040463号-3

导航

2025年3月14日