![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
OJ
正经无赖
这个作者很懒,什么都没留下…
展开
-
Google APAC test 2015 Round B Problem B - New Years Eve
源题链接:https://code.google.com/codejam/contest/4214486/dashboard#s=p1原创 2014-09-16 12:47:13 · 760 阅读 · 0 评论 -
Google APAC test 2015 Round B Problem A - Password Attacker
Problem A. Password AttackerPasswords are widely used in our lives: for ATMs, online forum logins, mobile device unlock and door access. Everyone cares about password security. However, attackers al转载 2014-09-16 12:40:08 · 668 阅读 · 0 评论 -
Google APAC test 2015 Round B Problem D-Parentheses Order
源题地址:https://code.google.com/codejam/contest/4214486/dashboard#s=p3原创 2014-09-16 14:31:24 · 742 阅读 · 0 评论 -
Google APAC test 2015 Round B Problem C - Card Game
源题地址:https://code.google.com/codejam/contest/4214486/dashboard#s=p2题意:一个无序数组,原创 2014-09-16 13:07:30 · 890 阅读 · 0 评论 -
Leetcode - 312 Burst Balloons
Leetcode - 312 Burst Balloons解题思路动态规划为了方便,做如下处理 nums = [1] + nums + [1]dp = [[0] * len(nums) for i in range(len(nums)) ]动态方案 dp[i][j]表示从nums[i:j+1]的最佳方案,注意这里的最佳是在指定nums[i-1]和nums[j+1]为临下的最佳 递推关系原创 2017-11-16 16:40:42 · 243 阅读 · 0 评论 -
leetcode - 354 Russian Doll Envelopes
leetcode - 354 Russian Doll Envelopes解题思路原题链接https://leetcode.com/problems/russian-doll-envelopes/description/原题内容You have a number of envelopes with widths and heights given as a pair of integers (w,原创 2017-11-16 17:09:00 · 249 阅读 · 0 评论