everything was much easier than I thought at first

All right,thanks.

Don't be afraid to add spaces and line breaks to make the code more readable. Name your variables well so that they are called what they are.
When you're working with other people readability is the number one criteria for well written code.
This even goes for yourself, don't write code that you understand now, write code that you'll understand in a year, when you have to do maintenance on it. :)

因为格式化的原因 看不太懂你的代码的运作机制 。。。

不知道你是否陷入题目陷阱，题目意思有：相邻的元素，方向如果是相反的，则同时放弃这两步

我也陷入这这个陷阱导致有一段时间没解决问题

Note

All paths can't be made simpler. The path ["NORTH", "WEST", "SOUTH", "EAST"] is not reducible. "NORTH" and "WEST", "WEST" and "SOUTH", "SOUTH" and "EAST" are not directly opposite of each other and can't become such. Hence the result path is itself : ["NORTH", "WEST", "SOUTH", "EAST"].

Hi! using ```{{ Your Codes Here }}``` to format your code and make it beauty

{{ Your Codes Here }}

A nice kata.

That's all right.

Yes, I got some troubles with it too.
On the output formatting paragraph, it says :
"The two subarrays are sorted in ascending order by their number weights if these weights are different, BY THEIR INDEXES IN THE STRING IF THEY HAVE THE SAME WEIGHTS."

The uppercase part of the paragraph is a lie.
The only sort you have to follow is the one on the weights.

Thank you, I just lost 30 minutes wondering why my solution wasn't working.

there is a bug in test;

I had the same issue - i pressed 2 times submit final button and the second time my solution was accepted, but I did not change anything in my code - strange - repeated two more times - same result.

Thank you Steffen for your reply. I can understand my wrong logic now:)

You do not do a real sorting on the array.
The using of a Set reduces same numbers and so you loose numbers and your result is wrong.