Documentation
¶
Overview ¶
https://leetcode.com/problems/find-common-characters/description/
Given an array A of strings made only from lowercase letters, return a list of all characters that show up in all strings within the list (including duplicates). For example, if a character occurs 3 times in all strings but not 4 times, you need to include that character three times in the final answer.
You may return the answer in any order.
Example 1:
Input: ["bella","label","roller"] Output: ["e","l","l"]
Example 2:
Input: ["cool","lock","cook"] Output: ["c","o"]
Note:
1 <= A.length <= 100 1 <= A[i].length <= 100 A[i][j] is a lowercase letter
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type MyHashMap ¶
type MyHashMap struct {
// contains filtered or unexported fields
}
func HashMapConstructor ¶
func HashMapConstructor() MyHashMap
* Initialize your data structure here.
func (*MyHashMap) Get ¶
* Returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key
Source Files
¶
- MyHashMap.go
- MyHashSet.go
- anagramMappings.go
- areSentencesSimilar.go
- commonChars.go
- containsDuplicate.go
- containsNearbyDuplicate.go
- distributeCandies.go
- findAnagrams.go
- findErrorNums.go
- findLHS.go
- findRepeatedDnaSequences.go
- findRestaurant.go
- findTheDifference.go
- findWords.go
- getHint.go
- groupAnagrams.go
- hIndex.go
- intersect.go
- intersection.go
- isAlienSorted.go
- isAnagram.go
- isIsomorphic.go
- isValidSudoku.go
- islandPerimeter.go
- longestPalindrome.go
- longestWord.go
- minWindow.go
- numJewelsInStones.go
- numberOfBoomerangs.go
- repeatedNTimes.go
- shortestCompletingWord.go
- subdomainVisits.go
- uncommonFromSentences.go
- uniqueMorseRepresentations.go
- wordPattern.go
Click to show internal directories.
Click to hide internal directories.