Q

Using dynamic programming algorithm with space compression optimization to solve the "1911. Maximum Alternating Subsequence Sum" problem.

Using sort by descending order and ascending order and Priority Queue based on max heap and min heap to solve '2679. Sum in a Matrix'.

枪战英雄^qUxJg$ca720ebf6eacc03fb08e714930e4ef2e57eb91654帮忙点击

谜拟Ｑ 披着破布，想要变得像皮卡丘一样受欢迎，小伙伴们说真正的皮卡丘会电击，于是，谜拟Ｑ 用颜料伪装电击吓跑了小伙伴。