2022年2月26日
[leetcode] 3. Longest Substring Without Repeating Characters
摘要： 题目 Given a string s, find the length of the longest substring without repeating characters. Example 1: Input: s = "abcabcbb" Output: 3 Explanation: Th 阅读全文
posted @ 2022-02-26 22:08 frankming 阅读(21) 评论(0) 推荐(0) 编辑
[leetcode] 19. Remove Nth Node From End of List
摘要： 题目 Given the head of a linked list, remove the nth node from the end of the list and return its head. Example 1: Input: head = [1,2,3,4,5], n = 2 Outp 阅读全文
posted @ 2022-02-26 00:01 frankming 阅读(21) 评论(0) 推荐(0) 编辑