IncredibleThings

导航

2021年2月20日 #

LeetCode - Number of Good Pairs

摘要: Given an array of integers nums. A pair (i,j) is called good if nums[i] == nums[j] and i < j. Return the number of good pairs. Example 1: Input: nums 阅读全文

posted @ 2021-02-20 16:04 IncredibleThings 阅读(30) 评论(0) 推荐(0) 编辑

LeetCode - Jewels and Stones

摘要: You're given strings jewels representing the types of stones that are jewels, and stones representing the stones you have. Each character in stones is 阅读全文

posted @ 2021-02-20 15:42 IncredibleThings 阅读(36) 评论(0) 推荐(0) 编辑

LeetCode - Unique Binary Search Trees II

摘要: Given an integer n, return all the structurally unique BST's (binary search trees), which has exactly n nodes of unique values from 1 to n. Return the 阅读全文

posted @ 2021-02-20 15:18 IncredibleThings 阅读(36) 评论(0) 推荐(0) 编辑