2017年7月3日
[LeetCode] K Inverse Pairs Array K个翻转对数组
摘要： Given two integers n and k, find how many different arrays consist of numbers from 1 to n such that there are exactly k inverse pairs. We define an in 阅读全文
posted @ 2017-07-03 15:33 Grandyang 阅读(6536) 评论(2) 推荐(1)
Fork me on GitHub