〈技术文章〉汇整页面- Hogan.B Lab

CES 2025：NVIDIA 如何用3 大关键推动AI 技术革新？

技术文章 / Roxanne / 2025 年1 月15 日

AI 的快速崛起正以前所未有的速度改变着我们的世界，而在这个浪潮中，NVIDIA 无疑是举足轻重的推手！在刚结束的CES 2024 中，NVIDIA 的多项发表再次引领了行业方向，无论是硬体性能的突破还是AI 应用的普及，都为AI 技术的未来发展注入了强劲动能。
今天，我们就来聚焦于NVIDIA 在CES 的一些最新发表，以及这些更新如何影响我们的未来！

CES 2025：NVIDIA 如何用3 大关键推动AI 技术革新？阅读更多 ”

技术文章

[Leetcode] 0023. Merge k Sorted Lists

You are given an array of k linked-lists lists, each linked-list is sorted in ascending order.

Merge all the linked-lists into one sorted linked-list and return it.

[Leetcode] 0023. Merge k Sorted Lists 阅读更多 ”

Leetcode, 技术文章leetcode

[Leetcode] 0021. Merge Two Sorted Lists

Leetcode, 技术文章 / Roxanne / 2024 年12 月30 日 / leetcode

You are given the heads of two sorted linked lists list1 and list2.

Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists.

Return the head of the merged linked list.

[Leetcode] 0021. Merge Two Sorted Lists 阅读更多 ”

Leetcode, 技术文章leetcode

[Leetcode] 2402. Meeting Rooms III

Leetcode, 技术文章 / Roxanne / 2024 年12 月29 日 / leetcode

ou are given an integer n. There are n rooms numbered from 0 to n – 1.

You are given a 2D integer array meetings where meetings[i] = [starti, endi] means that a meeting will be held during the half-closed time interval [starti, endi). All the values of starti are unique.

Meetings are allocated to rooms in the following manner:

Each meeting will take place in the unused room with the lowest number.
If there are no available rooms, the meeting will be delayed until a room becomes free. The delayed meeting should have the same duration as the original meeting.
When a room becomes unused, meetings that have an earlier original start time should be given the room.
Return the number of the room that held the most meetings. If there are multiple rooms, return the room with the lowest number.

A half-closed interval [a, b) is the interval between a and b including a and not including b.

[Leetcode] 2402. Meeting Rooms III 阅读更多 ”

Leetcode, 技术文章leetcode

[Leetcode] 0253. Meeting Rooms II

Leetcode, 技术文章 / Roxanne / 2024 年12 月28 日 / leetcode

Given an array of meeting time intervals intervals where intervals[i] = [starti, endi], return the minimum number of conference rooms required.

[Leetcode] 0253. Meeting Rooms II 阅读更多 ”

Leetcode, 技术文章leetcode

[Leetcode] 0252. Meeting Rooms

Leetcode, 技术文章 / Roxanne / 2024 年12 月27 日 / leetcode

Given an array of meeting time intervals where intervals[i] = [starti, endi], determine if a person could attend all meetings.

[Leetcode] 0252. Meeting Rooms 阅读更多 ”

Leetcode, 技术文章leetcode

[Leetcode] 0435. Non-overlapping Intervals

Leetcode, 技术文章 / Roxanne / 2024 年12 月26 日 / leetcode

Explore diverse LeetCode solutions in Python, C++, Java

[Leetcode] 0435. Non-overlapping Intervals 阅读更多 ”

Leetcode, 技术文章leetcode

[Leetcode] 0056. Merge Intervals

Leetcode, 技术文章 / Roxanne / 2024 年12 月25 日 / leetcode

Explore diverse LeetCode solutions in Python, C++, Java

[Leetcode] 0056. Merge Intervals 阅读更多 ”

Leetcode, 技术文章leetcode

[Leetcode] 0057. Insert Interval

Leetcode, 技术文章 / Roxanne / 2024 年12 月24 日 / leetcode

You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order by starti. You are also given an interval newInterval = [start, end] that represents the start and end of another interval.

Insert newInterval into intervals such that intervals is still sorted in ascending order by starti and intervals still does not have any overlapping intervals (merge overlapping intervals if necessary).

Return intervals after the insertion.

Note that you don't need to modify intervals in-place. You can make a new array and return it.

[Leetcode] 0057. Insert Interval 阅读更多 ”

Leetcode, 技术文章leetcode