无码av一区二区三区无码,在线观看老湿视频福利,日韩经典三级片,成 人色 网 站 欧美大片在线观看

歡迎光臨散文網(wǎng) 會(huì)員登陸 & 注冊(cè)

Leetcode 2273. Find Resultant Array After Removing Anagrams

2023-03-09 08:20 作者:您是打尖兒還是住店呢  | 我要投稿

You are given a?0-indexed?string array?words, where?words[i]?consists of lowercase English letters.

In one operation, select any index?i?such that?0 < i < words.length?and?words[i - 1]?and?words[i]?are?anagrams, and?delete?words[i]?from?words. Keep performing this operation as long as you can select an index that satisfies the conditions.

Return?words?after performing all operations. It can be shown that selecting the indices for each operation in?any?arbitrary order will lead to the same result.

An?Anagram?is a word or phrase formed by rearranging the letters of a different word or phrase using all the original letters exactly once. For example,?"dacb"?is an anagram of?"abdc".

?

Example 1:

Input: words = ["abba","baba","bbaa","cd","cd"]

Output: ["abba","cd"]

Explanation:One of the ways we can obtain the resultant array is by using the following operations:?

- Since words[2] = "bbaa" and words[1] = "baba" are anagrams,?

we choose index 2 and delete words[2].?

?Now words = ["abba","baba","cd","cd"].?

- Since words[1] = "baba" and words[0] = "abba" are anagrams,?

we choose index 1 and delete words[1]. ?Now words = ["abba","cd","cd"]. - Since words[2] = "cd" and words[1] = "cd"?

are anagrams, we choose index 2 and delete words[2]. ?Now words = ["abba","cd"].?

We can no longer perform any operations, so ["abba","cd"] is the final answer.

Example 2:

Input: words = ["a","b","c","d","e"]

Output: ["a","b","c","d","e"]

Explanation:No two adjacent strings in words are anagrams of each other, so no operations are performed.

?

Constraints:

  • 1 <= words.length <= 100

  • 1 <= words[i].length <= 10

  • words[i]?consists of lowercase English letters.

  • 所以理解題意是多么重要啊,我以為不是相鄰的都要看是否是Anagrams呢,所以用了hashmap,其實(shí)相鄰的就可,然后char[]轉(zhuǎn)換為字符串也絆了一跤,應(yīng)該是string.value of

    而不是tostring()方法;雖然是easy題目,教訓(xùn)深刻啊。

Runtime:?2 ms, faster than?95.29%?of?Java?online submissions for?Find Resultant Array After Removing Anagrams.

Memory Usage:?43.3 MB, less than?14.24%?of?Java?online submissions for?Find Resultant Array After Removing Anagrams.


Leetcode 2273. Find Resultant Array After Removing Anagrams的評(píng)論 (共 條)

分享到微博請(qǐng)遵守國(guó)家法律
河间市| 临夏县| 婺源县| 佛学| 抚宁县| 清水河县| 乐山市| 常州市| 潜山县| 涟水县| 杭州市| 启东市| 林周县| 双桥区| 河池市| 华容县| 绩溪县| 舒兰市| 策勒县| 奎屯市| 日土县| 南阳市| 建湖县| 武川县| 宁强县| 德阳市| 靖安县| 正安县| 松溪县| 和平区| 兰溪市| 和静县| 广宁县| 鄂托克前旗| 墨竹工卡县| 马关县| 阜城县| 溧阳市| 长丰县| 弥勒县| 那曲县|