- 博客(2)
- 收藏
- 关注
原创 locker
There are n lockers in a hallway numbered sequentially from 1 to n. Initially, all the locker doors are closed. You make n passes by the lockers, each time starting with locker #1. On the ith pass,
2016-11-21 12:03:46 421
原创 There are n lockers in a hallway numbered sequentially from 1 to n. Initially, all the locker doors
package xuexi; /* * n把锁问题 */ import java.util.ArrayList; import java.util.Arrays; import java.util.List; import java.util.Scanner; public class Locker { public static void main(String[]
2016-11-21 11:52:13 1308
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人