Re: 中科院开源协会 HI,all .一道有趣的面试题，大家集思广益，想想对策

[617020815]

我试过你说的算法，但是无法保证在有限时间内得出解啊。附件是我的解法

 Original Message 

Sender: Lihang Li<lica...@gmail.com>

Recipient: jxgu<jxgu...@gmail.com>

Cc: open...@googlegroups.com<open...@googlegroups.com>

Date: Tuesday, May 13, 2014 10:56

Subject: Re: 中科院开源协会 HI,all .一道有趣的面试题，大家集思广益，想想对策

问题规模小的话，试过随机算法了吗？

On Mon, May 12, 2014 at 11:22 PM, jxgu <jxgu...@gmail.com> wrote:

Problem: Finding the Restaurant in the Park

The Ruritanian National Park is covered by a network of hiking trails. The trails form a finite connected graph in which each node (that is, each junction of trails) is of degree 3. The junctions are indistinguishable one from another: it is impossible to know which junction one has arrived at, to identify the trails meeting there, or to recognise whether one has been there before. There is a strict rule against leaving litter in the park, so it is not permissible to mark junctions or trails in any way. There is another strict rule that if you enter a junction by one trail you must leave it by a different trail. Initially you have arrived at some node by one of its incident paths.

* Give an algorithm by which you will find the junction at which the restaurant is located. 

--
--
中科院开源软件协会
----------------------------------------------------------------------------------------------------------------------
发帖请发电子邮件到 open...@googlegroups.com
也可以直接通过 http://groups.google.com/group/open-cas?hl=zh-CN 访问论坛发贴
----------------------------------------------------------------------------------------------------------------------
开源协会的宗旨：自由软件精神——“自由开放分享”
望协会的各位成员能够发扬ubuntu精神—— "具有 ubuntu 精神的人心胸开阔，乐于助人，见贤思齐而不忌妒贤能，因为他或她拥有适度的自信，而这源自如下认识：自己属于一个更大的整体，当他人受到伤害或死去时，当他人受到折磨或压迫时，这个整体就会消失。"
----------------------------------------------------------------------------------------------------------------------

---
您收到此邮件是因为您订阅了Google网上论坛中的“中科院开源协会”论坛。
要退订此论坛并停止接收此论坛的电子邮件，请发送电子邮件到open-cas+u...@googlegroups.com。
要查看更多选项，请访问https://groups.google.com/d/optout。

--

Lihang Li
National Laboratory of Pattern Recognition (NLPR)
Institute of Automation, Chinese Academy of Sciences (IACAS)
95 Zhongguancun East Road
Beijing 100190, CHINA
Tel: +86-13811582143

Website: http://hustcalm.me

GoogleGroups:https://groups.google.com/forum/?hl=zh-CN#!forum/open-cas

--
--
中科院开源软件协会
----------------------------------------------------------------------------------------------------------------------
发帖请发电子邮件到 open...@googlegroups.com
也可以直接通过 http://groups.google.com/group/open-cas?hl=zh-CN 访问论坛发贴
----------------------------------------------------------------------------------------------------------------------
开源协会的宗旨：自由软件精神——“自由开放分享”
望协会的各位成员能够发扬ubuntu精神—— "具有 ubuntu 精神的人心胸开阔，乐于助人，见贤思齐而不忌妒贤能，因为他或她拥有适度的自信，而这源自如下认识：自己属于一个更大的整体，当他人受到伤害或死去时，当他人受到折磨或压迫时，这个整体就会消失。"
----------------------------------------------------------------------------------------------------------------------

---
您收到此邮件是因为您订阅了Google网上论坛中的“中科院开源协会”论坛。
要退订此论坛并停止接收此论坛的电子邮件，请发送电子邮件到open-cas+u...@googlegroups.com。
要查看更多选项，请访问https://groups.google.com/d/optout。

[617020815]

有人有确定性算法么，在有限时间内找到目标，求帮忙啊

 Original Message 

Sender: 617020815<6170...@qq.com>

Recipient: jxgu<jxgu...@gmail.com>; Lihang Li<lica...@gmail.com>

Cc: open...@googlegroups.com<open...@googlegroups.com>

Date: Thursday, May 22, 2014 10:20