Sort
konsy_dong
Java,C++,Python,linux
展开
-
LeetCode 349. Intersection of Two Arrays
题目: Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].思路: 找出nums2与nums1相交的元素,若重复,则只要一个。 具体思路见代码代码:class Solution { pub原创 2017-04-04 16:28:05 · 475 阅读 · 0 评论 -
LeetCode 350. Intersection of Two Arrays II
题目: Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].Note: Each element in the result should appear as many times a原创 2017-04-18 16:15:41 · 241 阅读 · 0 评论 -
LeetCode 242. Valid Anagram
题目: Given two strings s and t, write a function to determine if t is an anagram of s.For example, s = “anagram”, t = “nagaram”, return true. s = “rat”, t = “car”, return false.Note: You may assume原创 2017-04-18 16:45:07 · 246 阅读 · 0 评论 -
LeetCode 75. Sort Colors
题目: Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers原创 2017-04-19 10:22:13 · 340 阅读 · 0 评论 -
LeetCode 274. H-Index
题目: Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher’s h-index.According to the definition of h-index on Wikipedia: “A原创 2017-04-19 10:22:46 · 306 阅读 · 0 评论 -
LeetCode 524. Longest Word in Dictionary through Deleting
题目: Given a string and a string dictionary, find the longest string in the dictionary that can be formed by deleting some characters of the given string. If there are more than one possible results, r原创 2017-04-19 10:24:14 · 461 阅读 · 0 评论