xinyu04

导航

2022年7月11日 #

LeetCode First Missing Positive Map

摘要： Given an unsorted integer array nums, return the smallest missing positive integer. You must implement an algorithm that runs in $O(n)$ time and uses 阅读全文

posted @ 2022-07-11 20:06 Blackzxy 阅读(25) 评论(0) 推荐(0)

LeetCode 3Sum 双指针

摘要： 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 @ 2022-07-11 03:20 Blackzxy 阅读(30) 评论(0) 推荐(0)