2021年2月14日
[LeetCode] 765. Couples Holding Hands
摘要： N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum number of swaps so that every couple is sitting side b 阅读全文
posted @ 2021-02-14 13:58 CNoodle 阅读(332) 评论(0) 推荐(0)
[LeetCode] 1091. Shortest Path in Binary Matrix
摘要： Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If there is no clear path, return -1. A clear path in a 阅读全文
posted @ 2021-02-14 08:24 CNoodle 阅读(226) 评论(0) 推荐(0)
[LeetCode] 978. Longest Turbulent Subarray
摘要： Given an integer array arr, return the length of a maximum size turbulent subarray of arr. A subarray is turbulent if the comparison sign flips betwee 阅读全文
posted @ 2021-02-14 03:46 CNoodle 阅读(96) 评论(0) 推荐(0)