LeetCode Weekly Contest 33是LeetCode举办的第三十八场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-33/
题解列表：
LeetCode 594. Longest Harmonious Subsequence
归档 2017年5月21日
LeetCode Weekly Contest 33解题报告
[LeetCode]Design In-Memory File System
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 588. Design In-Memory File System
Design an in-memory file system to simulate the following functions:
ls: Given a path in string format. If it is a file path, return a list that only contains this file's name. If ...
[LeetCode]Fraction Addition and Subtraction
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 592. Fraction Addition and Subtraction
Given a string representing an expression of fraction addition and subtraction, you need to return the calculation result in string format. The final result should be irreducible fraction. If your final result is ...
[LeetCode]Valid Square
作者是
发布于
在
LeetCode.
题目描述：
Given the coordinates of four points in 2D space, return whether the four points could construct a square.
The coordinate (x,y) of a point is represented by an integer array with two integers.
Example ...
[LeetCode]Longest Harmonious Subsequence
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 594. Longest Harmonious Subsequence
We define a harmonious array is an array where the difference between its maximum value and its minimum value is exactly 1.
Now, given an integer array, you need to find the length of ...