iyiluo

2023年1月4日

摘要： Intersection of Two Arrays Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique 阅读全文

posted @ 2023-01-04 19:20 iyiluo 阅读(14) 评论(0) 推荐(0)

leetcode-350-easy

摘要： Intersection of Two Arrays II Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear 阅读全文

posted @ 2023-01-04 19:19 iyiluo 阅读(13) 评论(0) 推荐(0)

leetcode-367-easy

摘要： Valid Perfect Square Given a positive integer num, return true if num is a perfect square or false otherwise. A perfect square is an integer that is t 阅读全文

posted @ 2023-01-04 19:19 iyiluo 阅读(19) 评论(0) 推荐(0)

leetcode-387-easy

摘要： First Unique Character in a String Given a string s, find the first non-repeating character in it and return its index. If it does not exist, return - 阅读全文

posted @ 2023-01-04 19:19 iyiluo 阅读(12) 评论(0) 推荐(0)

leetcode-414-easy

摘要： Third Maximum Number Given an integer array nums, return the third distinct maximum number in this array. If the third maximum does not exist, return 阅读全文

posted @ 2023-01-04 19:18 iyiluo 阅读(15) 评论(0) 推荐(0)

2023年1月3日

leetcode-206-easy

摘要： Reverse Linked List Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: Input: head = [1,2,3,4,5] Outpu 阅读全文

posted @ 2023-01-03 21:36 iyiluo 阅读(24) 评论(0) 推荐(0)

leetcode-168-easy

摘要： Excel Sheet Column Title Given an integer columnNumber, return its corresponding column title as it appears in an Excel sheet. For example: A -> 1 B - 阅读全文

posted @ 2023-01-03 21:35 iyiluo 阅读(24) 评论(0) 推荐(0)

leetcode-145-easy

摘要： Binary Tree Postorder Traversal Given the root of a binary tree, return the postorder traversal of its nodes' values. Example 1: Input: root = [1,null 阅读全文

posted @ 2023-01-03 21:35 iyiluo 阅读(28) 评论(0) 推荐(0)

leetcode-144-easy

摘要： Binary Tree Preorder Traversal Given the root of a binary tree, return the preorder traversal of its nodes' values. Example 1: Input: root = [1,null,2 阅读全文

posted @ 2023-01-03 21:34 iyiluo 阅读(20) 评论(0) 推荐(0)

leetcode-121-easy

摘要： Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your 阅读全文

posted @ 2023-01-03 21:34 iyiluo 阅读(20) 评论(0) 推荐(0)

公告