Dirty rooms

來源: deal_or_no_deal 2009-05-10 19:24:30 [] [舊帖] [給我悄悄話] 本文已被閱讀: 次 (918 bytes)
int N; // total rooms
volatile Room rooms[1..N]
int nextDirtyRoomNumber = 1
int nextDirtyRoomNumbers[1..N]

foreach i in [1..N]:
nextDirtyRoomNumbers[i] = i + 1

while true:
sleep 1 minute
nextDirtyRoomNumber = checkRooms(nextDirtyRoomNumber)
if nextDirtyRoomNumber == N
break
i = nextDirtyRoomNumber
dirty_room_number = []
do
dirty_room_number.append(i)
i = nextDirtyRoomNumbers[i]
while i < N
send dirty_room_number
send 'all clean'

function checkRoomsReturnNextDirtyRoomNumber(startNumber):
if startNumber == N:
return N
nextRoomToCheck = nextDirtyRoomNumbers[startNumber]
if rooms[startNumber].dirty:
nextDirtyRoomNumbers[startNumber] = checkRoomsReturnNextDirtyRoomNumber(nextRoomToCheck)
return startNumber
return checkRoomsReturnNextDirtyRoomNumber[nextRoomToCheck)

所有跟帖: 

哈哈,以為是罵人呢。 -貧論元- 給 貧論元 發送悄悄話 (0 bytes) () 05/11/2009 postreply 06:10:33

請您先登陸,再發跟帖!

發現Adblock插件

如要繼續瀏覽
請支持本站 請務必在本站關閉Adblock

關閉Adblock後 請點擊

請參考如何關閉Adblock

安裝Adblock plus用戶請點擊瀏覽器圖標
選擇“Disable on www.wenxuecity.com”

安裝Adblock用戶請點擊圖標
選擇“don't run on pages on this domain”