HackerRank
junchen1992
Be the change that you wish to see in the world.
展开
-
HackerRank: Bricks Game
题目链接分析本题使用动态规划的思想解决。dp[i]表示:若player从当前位置开始,能获得的最大分数。很明显,需要逆序构建dp数组。代码(Python 2.7)t = int(raw_input())for t_i in xrange(t): n = int(raw_input()) a = map(int, raw_input().split()) cum_sum = [原创 2016-08-17 13:30:37 · 376 阅读 · 0 评论 -
HackerRank: Sam and sub-strings
题目链接分析考虑每一位数字对最终总和的贡献,画出表格分析小例子得到模式。代码s = raw_input()n = len(s)candies = 0mul = 1MOD = 1000000007for index in xrange(n - 1, -1, -1): candies = (candies + (ord(s[index]) - ord('0')) * mul *(ind原创 2016-08-17 18:30:07 · 527 阅读 · 0 评论 -
HackerRank: Play with words
题目链接分析经典动态规划问题“最长回文子串(Longest Palindromic Subsequence)”的变形。动态规划#!/usr/bin/pythons = raw_input()n = len(s)dp = [[0 for i in xrange(n)] for j in xrange(n)]for i in xrange(n): dp[i][i] = 1for col i原创 2016-08-18 09:28:37 · 399 阅读 · 0 评论 -
PIQ39: Longest Common Subsequence
Problem StatementGiven two string s1 and s2. Find the longest common subsequence between s1 and s2.Link@HackerRank: The Longest Common Subsequencedef longest_common_subsequence(s1, s2): """Find the原创 2016-08-23 09:00:05 · 307 阅读 · 0 评论