BJUT_bluecat的博客

docker pull amouat/identidock:unsignedexport DOCKER_CONTENT_TRUST=1docker pull debian:wheezydocker run -d --name influxdb -p 8086:8086 tutum/influxdbcreate database "cadvisor...

参考：https://www.cnblogs.com/fengziwei/p/7827959.html#include <iostream>#include <string>#include <algorithm>using namespace std;void DP() { string s1, s2; string ans = "";...

152. Maximum Product SubarrayMedium159373FavoriteShareGiven an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.E...

115. Distinct SubsequencesHard54125FavoriteShareGiven a string S and a string T, count the number of distinct subsequences of S which equals T.A subsequence of a string is a new string which i...

class Solution {public: int minimumTotal(vector&lt;vector&lt;int&gt;&gt;&amp; triangle) { //从下向上加 vector&lt;int&gt; minans(triangle.back()); for (int layer = triangle.size() - 2; layer ...

解法参考：https://blog.youkuaiyun.com/yujin753/article/details/48010677Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-sepa...

class Solution { public int canCompleteCircuit(int[] gas, int[] cost) { int ans=0;//从第一个开始试 //用gas-cost 连续加为正数的可以 负数不可以 int []temp=new int[gas.length]; for(int i=0;i&lt;gas.length;i++) ...

112. Path SumDescriptionHintsSubmissionsDiscussSolutionPick OneGiven a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the...

参考// 最少硬币.cpp : 定义控制台应用程序的入口点。//#include "stdafx.h"#include &lt;iostream&gt;#include &lt;vector&gt;#include &lt;map&gt;#include &lt;limits&gt;using namespace std;class hh {public: vector&l...

class Solution {public: //动态规划 连着两个能变成新的加1 反之等于dp[i-1] bool judge(string s) { int gewei,shiwei,ans; gewei = s[1] - '0'; shiwei = s[0] - '0'; ans = gewei + 10 * shiwei; return (ans &gt; ...

可以参考下面的文章 思路写的比较清晰https://blog.youkuaiyun.com/u010293698/article/details/48979623https://blog.youkuaiyun.com/sinat_22991367/article/details/51861373给定n种物品和一个背包，物品i的重量是wi，其价值为vi，背包的容量为C。背包问题是如何选择装入背包的物品，使得装入背包中物品的...

数字三角形(POJ1163)输入格式：5      //表示三角形的行数    接下来输入三角形73   88   1   02   7   4   44   5   2   6   5要求输出最大和与递归类似，分解成若干字问题，但相互直接有联系，每一层的最大值由下面那层而来。#include "stdafx.h"#include &lt;iostream&gt; #include &l...

/*//分治法：如果首字母相同 就递归剩下的字符串 程序显而易见 但递归必然超时 所以用动态规划class Solution {public: bool isInterleave(string s1, string s2, string s3) { // Start typing your C/C++ solution below // DO NOT write int mai...

题解参考http://www.cnblogs.com/grandyang/p/4344107.html72. Edit DistanceDescriptionHintsSubmissionsDiscussSolutionPick OneGiven two words word1 and word2, find the minimum number of steps required to conv...