- 博客(2)
- 资源 (3)
- 收藏
- 关注
原创 HackerRank- Minimum Swap 2 数组排序最小交换次数
原题: https://www.hackerrank.com/challenges/minimum-swaps-2/problem?h_l=interview&playlist_slugs%5B%5D=interview-preparation-kit&playlist_slugs%5B%5D=arrays 问题的关键是找到闭环。假设每个闭环有k个数字,则闭环内交换次数为...
2018-09-11 22:28:48
1473
原创 LeetCode 219. Contains Duplicate II
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and j is at most k.
2016-04-12 20:43:04
242
数据库系统概念(Database system concepts第五版答案(超全))
2014-03-18
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人