MissZhou要努力

这个题又是想难了，联想到poj2549 看了题解 自己写WA了好多次 ==其实之前犯过这个错误T^T 跳出循环时要注意 题中给的数得读入结束才行 长点心吧。。。 Problem Description Given a permutation P of 1 to N, YY wants to know whether there exists such three elements P[i1

裸的哈希==其实根本算不上什么算法的== 前m大的数 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13271    Accepted Submission(s): 4521 Problem Description

https://leetcode.com/problems/group-anagrams/description/ Given an array of strings, group anagrams together. Example: Input: ["eat", "tea", "tan", "ate", "nat", "bat"], Output: [ ["ate