摘要:
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 @ 2018-08-28 17:11
f91og
阅读(507)
评论(0)
推荐(0)
摘要:
https://leetcode.com/problems/cherry-pickup/description/ In a N x N grid representing a field of cherries, each cell is one of three possible integers 阅读全文
posted @ 2018-08-28 01:22
f91og
阅读(440)
评论(0)
推荐(0)
浙公网安备 33010602011771号