Kidpea LAU ' BLOG

Given two arrays, write a function to compute their intersection. 给定两个数组，编写一个函数来计算它们的交集。 EX1: Input: nums1 = [1,2,2,1], nums2 = [2,2] Output: [2,2] EX2: Input: nums1 = [4,9,5], nums2 = [9,4,9...

--Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. --给定一个字符串，找到它的第一个不重复的字符，并返回它的索引。如果不存在，则返回 -1。 s = "leetcode" 返回 0. s = "lov...