06 2017 档案

美团点评2017秋招笔试编程题
摘要：美团点评2017秋招笔试编程题 1， 大富翁游戏，玩家根据骰子的点数决定走的步数，即骰子点数为1时可以走一步，点数为2时可以走两步，点数为n时可以走n步。求玩家走到第n步（n<=骰子最大点数且是方法的唯一入参）时，总共有多少种投骰子的方法。 题解： 写出前面的几个， 1 -> 1; 2 -> 2 ; 阅读全文
posted @ 2017-06-28 20:43 zhang--yd 阅读(636) 评论(0) 推荐(0) 编辑
Leetcode - 628 Maximum Product of Three Numbers
摘要：Leetcode - 628 Maximum Product of Three Numbers 628. Maximum Product of Three Numbers 628. Maximum Product of Three Numbers 628. Maximum Product of Th 阅读全文
posted @ 2017-06-26 22:04 zhang--yd 阅读(390) 评论(0) 推荐(0) 编辑
Leetcode - 605 - Can Place Flowers
摘要：Leetcode - 605 - Can Place Flowers 605. Can Place Flowers 605. Can Place Flowers 605. Can Place Flowers 605. Can Place Flowers Suppose you have a long 阅读全文
posted @ 2017-06-26 21:30 zhang--yd 阅读(287) 评论(0) 推荐(0) 编辑
Leetcode - 623 - Add One Row to Tree
摘要：Leetcode - 623 - Add One Row to Tree 623. Add One Row to Tree 623. Add One Row to Tree 623. Add One Row to Tree 623. Add One Row to Tree Given the roo 阅读全文
posted @ 2017-06-22 21:14 zhang--yd 阅读(316) 评论(0) 推荐(0) 编辑
Leetcode - 624 - Maximum Distance in Arrays
摘要：Leetcode - 624 - Maximum Distance in Arrays 624. Maximum Distance in Arrays 624. Maximum Distance in Arrays 624. Maximum Distance in Arrays 624. Maxim 阅读全文
posted @ 2017-06-22 20:57 zhang--yd 阅读(377) 评论(0) 推荐(0) 编辑
leetcode -625-Minimum Factorization
摘要：leetcode -625-Minimum Factorization 625. Minimum Factorization 625. Minimum Factorization 625. Minimum Factorization 625. Minimum Factorization Given 阅读全文
posted @ 2017-06-22 20:35 zhang--yd 阅读(399) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示