• 博客园logo
  • 会员
  • 周边
  • 新闻
  • 博问
  • 闪存
  • 众包
  • 赞助商
  • Chat2DB
    • 搜索
      所有博客
    • 搜索
      当前博客
  • 写随笔 我的博客 短消息 简洁模式
    用户头像
    我的博客 我的园子 账号设置 会员中心 简洁模式 ... 退出登录
    注册 登录
neverlandly
博客园    首页    新随笔    联系   管理    订阅  订阅
2017年2月14日
Leetcode: The Maze III(Unsolved Lock Problem)
摘要: Each time, first add the direction to the path, and then go with that direction, checking for hole along the way. When hit a wall, try to turn, and go 阅读全文
posted @ 2017-02-14 02:45 neverlandly 阅读(846) 评论(0) 推荐(0)
Leetcode: The Maze II
摘要: Solution of The Maze: https://discuss.leetcode.com/topic/77471/easy-understanding-java-bfs-solutionSolution of The Maze III: https://discuss.leetcode. 阅读全文
posted @ 2017-02-14 02:43 neverlandly 阅读(1312) 评论(0) 推荐(0)
Leetcode: The Maze(Unsolved locked problem)
摘要: Search in the four possible directions when coming to a stopping point (i.e. a new starting point). Keep track of places that you already started at i 阅读全文
posted @ 2017-02-14 02:36 neverlandly 阅读(614) 评论(0) 推荐(0)
Leetcode: Max Consecutive Ones II(unsolved locked problem)
摘要: 未研究: The idea is to keep a window [l, h] that contains at most k zero The following solution does not handle follow-up, because nums[l] will need to a 阅读全文
posted @ 2017-02-14 01:40 neverlandly 阅读(416) 评论(0) 推荐(0)
Leetcode: Find Permutation(Unsolve lock problem)
摘要: 还没研究: For example, given IDIIDD we start with sorted sequence 1234567Then for each k continuous D starting at index i we need to reverse [i, i+k] port 阅读全文
posted @ 2017-02-14 01:36 neverlandly 阅读(491) 评论(0) 推荐(0)
博客园  ©  2004-2026
浙公网安备 33010602011771号 浙ICP备2021040463号-3