【CODE】字符串 && DP

最新推荐文章于 2020-05-03 18:11:38 发布
最新推荐文章于 2020-05-03 18:11:38 发布
阅读量195 收藏
点赞数
分类专栏： C/C++
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/Li_Jiaqian/article/details/104658906
版权

目录

712. Minimum ASCII Delete Sum for Two Strings

583. Delete Operation for Two Strings

72. Edit Distance

300. Longest Increasing Subsequence

334. Increasing Triplet Subsequence

1305. All Elements in Two Binary Search Trees

152. Maximum Product Subarray

712. Minimum ASCII Delete Sum for Two Strings

Medium

72241Add to ListShare

Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal.

Example 1:

Input: s1 = "sea", s2 = "eat"
Output: 231
Explanation: Deleting "s" from "sea" adds the ASCII value of "s" (115) to the sum.
Deleting "t" from "eat" adds 116 to the sum.
At the end, both strings are equal, and 115 + 116 = 231 is the minimum sum possible to achieve this.

Example 2:

Input: s1 = "delete", s2 = "leet"
Output: 403
Explanation: Deleting "dee" from "delete" to turn the string into "let",
adds 100[d]+101[e]+101[e] to the sum.  Deleting "e" from "leet" adds 101[e] to the sum.
At the end, both strings are equal to "let", and the answer is 100+101+101+101 = 403.
If instead we turned both strings into "lee" or "eet", we would get answers of 433 or 417, which are higher.

Note:

  • 0 < s1.length, s2.length <= 1000.
  • All elements of each string will have an ASCII value in [97, 122].
#include"pch.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<stack>
using namespace std;
/*712. Minimum ASCII Delete Sum for Two Strings
1.dp[i][j]表示s1的前i个与s2的前j个相等，要动多少次
dp[i][0]=s1的前i个字符累加，dp[0][j]=s2的前j个字符累加，注意第j个字符是s2[j-1]
若s1[i-1]==s2[j-1]，表明s1的第i个=s2的第j个，说明dp[i][j]=dp[i-1][[j-1]
若s1[i-1]!=s2[j-1]，表明从s1的前i个到s2的前j个，需要删除s1[i-1]或者s2[j-1]，
若删除s1[i-1]，dp[i][j]=dp[i-1][j]+s1[i-1]，否则dp[i][j]=dp[i][j-1]+s2[j-1].
Runtime: 24 ms, faster than 80.39% of C++ online submissions for Minimum ASCII Delete Sum for Two Strings.
Memory Usage: 16.7 MB, less than 77.78% of C++ online submissions for Minimum ASCII Delete Sum for Two Strings.*/
int minimumDeleteSum1(string s1, string s2) {
	int n1 = s1.size(), n2 = s2.size();
	vector<vector<int> > dp(n1 + 1, vector<int>(n2 + 1));
	for (int i = 1; i <= n1; i++) {
		dp[i][0] = dp[i - 1][0] + s1[i - 1];
	}for (int j = 1; j <= n2; j++) {
		dp[0][j] = dp[0][j - 1] + s2[j - 1];
	}for (int i = 1; i <= n1; i++) {
		for (int j = 1; j <= n2; j++) {
			if (s1[i - 1] == s2[j - 1]) dp[i][j] = dp[i - 1][j - 1];
			else {
				dp[i][j] = min(dp[i - 1][j] + s1[i - 1], dp[i][j - 1] + s2[j - 1]);
			}
		}
	}
	return dp[n1][n2];
}
/*2.最大相同子序列的ascii值
dp[i][j]表示s1前i个与s2前j个相同字符的ascii和值
dp[i][0]=0,dp[0][j]=0
s1[i-1]==s2[j-1]:dp[i][j]=dp[i-1][j-1]+s1[i-1]
s1[i-1]!=s2[j-1]:dp[i][j]=max(dp[i-1][j],dp[i][j-1])
需要删除的字符=s1和s2总的字符-相同字符*2
Runtime: 24 ms, faster than 80.39% of C++ online submissions for Minimum ASCII Delete Sum for Two Strings.
Memory Usage: 16.7 MB, less than 77.78% of C++ online submissions for Minimum ASCII Delete Sum for Two Strings.*/
int minimumDeleteSum(string s1, string s2) {
	int n1 = s1.size(), n2 = s2.size();
	vector<vector<int> > dp(n1+1, vector<int>(n2+1));
	int sum=0;
	for (int i = 1; i <= n1; i++) {
		sum += s1[i - 1];
		for (int j = 1; j <= n2; j++) {
			if (i == 1) sum += s2[j - 1];
			if (s1[i - 1] == s2[j - 1]) dp[i][j] = dp[i - 1][j - 1] + s1[i - 1];
			else dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
		}
	}
	return sum-2*dp[n1][n2];
}
int main() {
	string s1 = "delete", s2 = "leet";
	cout << minimumDeleteSum(s1, s2);
	return 0;
}

583. Delete Operation for Two Strings

Medium

88124Add to ListShare

Given two words word1 and word2, find the minimum number of steps required to make word1 and word2 the same, where in each step you can delete one character in either string.

Example 1:

Input: "sea", "eat"
Output: 2
Explanation: You need one step to make "sea" to "ea" and another step to make "eat" to "ea".

Note:

  1. The length of given words won't exceed 500.
  2. Characters in given words can only be lower-case letters.
class Solution {
public:
    /*Runtime: 16 ms, faster than 81.17% of C++ online submissions for Delete Operation for Two Strings.
    Memory Usage: 13.4 MB, less than 55.56% of C++ online submissions for Delete Operation for Two Strings.*/
    int minDistance(string word1, string word2) {
        int n1=word1.size(),n2=word2.size();
        vector<vector<int> > dp(n1+1,vector<int>(n2+1));
        int res=0;
        for(int i=1;i<=n1;i++) dp[i][0]=i;
        for(int j=1;j<=n2;j++) dp[0][j]=j;
        for(int i=1;i<=n1;i++){
            for(int j=1;j<=n2;j++){
                if(word1[i-1]!=word2[j-1]) dp[i][j]=min(dp[i-1][j],dp[i][j-1])+1;
                else dp[i][j]=dp[i-1][j-1];
            }
        }
        return dp[n1][n2];
    }
};

72. Edit Distance

Hard

302244Add to ListShare

Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.

You have the following 3 operations permitted on a word:

  1. Insert a character
  2. Delete a character
  3. Replace a character

Example 1:

Input: word1 = "horse", word2 = "ros"
Output: 3
Explanation: 
horse -> rorse (replace 'h' with 'r')
rorse -> rose (remove 'r')
rose -> ros (remove 'e')

Example 2:

Input: word1 = "intention", word2 = "execution"
Output: 5
Explanation: 
intention -> inention (remove 't')
inention -> enention (replace 'i' with 'e')
enention -> exention (replace 'n' with 'x')
exention -> exection (replace 'n' with 'c')
exection -> execution (insert 'u')
#include"pch.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<stack>
using namespace std;
/*72. Edit Distance
dp[i][j]表示word1前i个变为word2前j个需要的步骤数量
dp[i][0]=i，dp[0][j]=j
word1[i-1]==word2[j-1],dp[i][j]=dp[i-1][j-1]
word1[i-1]!=word2[j-1],有三种情况：
删除word1[i-1]:接下来比较word1[i]和word2[j-1],dp[i][j-1]+1
插入word2[j-1]:接下来比较word2[j]和word1[i-1],dp[i-1][j]+1
替换:接下来比较word1[i]和word2[j],dp[i-1][j-1]+1
Runtime: 0 ms, faster than 100.00% of C++ online submissions for Edit Distance.
Memory Usage: 10.5 MB, less than 71.88% of C++ online submissions for Edit Distance.*/
int minDistance(string word1, string word2) {
	int n1 = word1.size(), n2 = word2.size();
	vector<vector<int> > dp(n1 + 1, vector<int>(n2 + 1));
	for (int i = 1; i <= n1; i++) dp[i][0] = i;
	for (int j = 1; j <= n2; j++) dp[0][j] = j;
	for (int i = 1; i <= n1; i++) {
		for (int j = 1; j <= n2; j++) {
			if (word1[i - 1] == word2[j - 1]) dp[i][j] = dp[i - 1][j - 1];
			else dp[i][j] = min(dp[i - 1][j - 1], min(dp[i][j - 1], dp[i - 1][j])) + 1;
		}
	}
	return dp[n1][n2];
}
int main() {
	string s1 = "horse", s2 = "ros";
	cout << minDistance(s1, s2);
	return 0;
}

300. Longest Increasing Subsequence

Medium

374185Add to ListShare

Given an unsorted array of integers, find the length of longest increasing subsequence.

Example:

Input: [10,9,2,5,3,7,101,18]
Output: 4 
Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4.

Note:

  • There may be more than one LIS combination, it is only necessary for you to return the length.
  • Your algorithm should run in O(n2) complexity.

Follow up: Could you improve it to O(n log n) time complexity?

#include"pch.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<stack>
using namespace std;
/*300. Longest Increasing Subsequence
1.最长递增子序列,dp[i]表示以nums[i]为结尾的最长递增子串长度
对于每个nums[i]，从0搜索到i，如果发现某个数nums[j]，小于nums[i]，更新dp[i]
dp[i]=max(dp[i],dp[j]+1)
Runtime: 40 ms, faster than 49.19% of C++ online submissions for Longest Increasing Subsequence.
Memory Usage: 8 MB, less than 100.00% of C++ online submissions for Longest Increasing Subsequence.*/
int lengthOfLIS1(vector<int>& nums) {
	if (nums.size() == 0) return 0;
	vector<int> dp(nums.size(),1);
	int res = 1;
	for (int i = 0; i < nums.size(); i++) {
		for (int j = 0; j <= i; j++) {
			if (nums[j] < nums[i]) dp[i] = max(dp[i], dp[j]+1);
		}
		res = max(res, dp[i]);
	}
	return res;
}
/*2.使用二分查找加快运行速度，建立空的dp数组，开始遍历原数组
对于每一个遍历到的数字，用二分查找在dp数组找 第一个≥它 的数字，
如果这个数字不存在，那么直接在dp后加上遍历到的这个数字，
如果存在，将这个数字更新为刚刚遍历到的数字，就是对于长度可能相等的子序列，部分最大值要更小一些
dp数组中的值可能不是一个真实的LIS
Runtime: 4 ms, faster than 91.34% of C++ online submissions for Longest Increasing Subsequence.
Memory Usage: 8.1 MB, less than 100.00% of C++ online submissions for Longest Increasing Subsequence.*/
int lengthOfLIS(vector<int>& nums) {
	vector<int> dp;
	for (int i = 0; i < nums.size(); i++) {
		if (dp.size()==0 || dp.size()>0 && dp.back()<nums[i]) dp.push_back(nums[i]);
		else {
			//找 第一个≥nums[i] 的
			int left = 0, right = dp.size();
			while (left < right) {
				int mid = left + (right - left) / 2;
				if (dp[mid] < nums[i]) left = mid + 1;
				else right = mid ;
			}
			dp[right] = nums[i];
		}
	}
	return dp.size();
}
int main() {
	vector<int> nums = {3,5,6,2,5,4,19,5,6,7,12};
	cout << lengthOfLIS(nums);
	return 0;
}

334. Increasing Triplet Subsequence

Medium

1265115Add to ListShare

Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.

Formally the function should:

Return true if there exists  i, j, k
such that  arr[i] <  arr[j] <  arr[k] given 0 ≤  i <  j <  k ≤  n-1 else return false.

Note: Your algorithm should run in O(n) time complexity and O(1) space complexity.

Example 1:

Input: [1,2,3,4,5]
Output: true

Example 2:

Input: [5,4,3,2,1]
Output: false
#include"pch.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<stack>
using namespace std;
/*334. Increasing Triplet Subsequence
是否有三个数递增，递增子序列长度是否大于等于3
Runtime: 300 ms, faster than 5.27% of C++ online submissions for Increasing Triplet Subsequence.
Memory Usage: 8.2 MB, less than 100.00% of C++ online submissions for Increasing Triplet Subsequence.*/
bool increasingTriplet(vector<int>& nums) {
	vector<int> dp(nums.size(),1);
	for (int i = 1; i < nums.size(); i++) {
		for (int j = i; j >= 0; j--) {
			if (nums[i] > nums[j]) dp[i] = max(dp[i], dp[j] + 1);
			if (dp[i] >= 3) return true;
		}
	}
	return false;
}
int main() {
	vector<int> nums = {5,4,3,2,1};
	cout << increasingTriplet(nums);
	return 0;
}

1305. All Elements in Two Binary Search Trees

Medium

1826Add to ListShare

Given two binary search trees root1 and root2.

Return a list containing all the integers from both trees sorted in ascending order.

 

Example 1:

Input: root1 = [2,1,4], root2 = [1,0,3]
Output: [0,1,1,2,3,4]

Example 2:

Input: root1 = [0,-10,10], root2 = [5,1,7,0,2]
Output: [-10,0,0,1,2,5,7,10]

Example 3:

Input: root1 = [], root2 = [5,1,7,0,2]
Output: [0,1,2,5,7]

Example 4:

Input: root1 = [0,-10,10], root2 = []
Output: [-10,0,10]

Example 5:

Input: root1 = [1,null,8], root2 = [8,1]
Output: [1,1,8,8]

Constraints:

  • Each tree has at most 5000 nodes.
  • Each node's value is between [-10^5, 10^5].
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    /*返回二叉搜索树中的所有值，升序，中序遍历
    Runtime: 436 ms, faster than 7.78% of C++ online submissions for All Elements in Two Binary Search Trees.   
    Memory Usage: 56.3 MB, less than 100.00% of C++ online submissions for All Elements in Two Binary Search Trees.*/
    vector<int> getAllElements(TreeNode* root1, TreeNode* root2) {
        vector<int> res;
	    stack<TreeNode *> s;
        while(root1 || !s.empty()){
            while(root1){
                s.push(root1);
                root1=root1->left;
            }
            TreeNode *tmp=s.top();
            s.pop();
            res.push_back(tmp->val);
            root1=tmp->right;
        }
        int left=0,flag=0;
        if(res.size()==0) flag=1;
	    while(root2 || !s.empty()){
            while(root2){
                s.push(root2);
                root2=root2->left;
            }
            TreeNode *tmp=s.top();
            s.pop();
            root2=tmp->right;
            if(flag==1) res.push_back(tmp->val);
            else{
                while(left<res.size() && res[left]<tmp->val) left++;
                if(left==res.size()){ flag=1; res.push_back(tmp->val);}
                else res.insert(res.begin()+left,tmp->val);
            }
        }
        return res;
    }
};

152. Maximum Product Subarray

Medium

3208135Add to ListShare

Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.

Example 1:

Input: [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.

Example 2:

Input: [-2,0,-1]
Output: 0
Explanation: The result cannot be 2, because [-2,-1] is not a subarray.
#include"pch.h"
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<unordered_map>
using namespace std;
/*152. Maximum Product Subarray
1.动态规划，计算j->i的乘积，超时*/
int maxProduct1(vector<int>& nums) {
	int n = nums.size();
	int res = nums[0];
	vector<vector<int> > dp(n, vector<int>(n));
	for (int i = 0; i < n; i++) {
		for (int j = i; j >= 0; j--) {
			if (j == i) dp[j][i] = nums[i];
			else {
				dp[j][i] = dp[j + 1][i] * nums[j];
			}
			res = max(res, dp[j][i]);
		}
	}
	return res;
}
/*2.用两个变量表示当前最大值和最小值，对于当前的nums[i]做了正负讨论
（1）遍历到正数，此时最大值=max(该正数，之前最大值*该正数)，最小值=min(该正数，之前最小值*该正数)
（2）遍历到负数，先保存之前的最大值max1，此时最大值=max(该负数，之前最小值*该负数)，最小值=min(该负数，max1*该负数)
（3）每遍历完一个数，都要更新最终最大值，如果是求最小值，一样的
Runtime: 4 ms, faster than 88.25% of C++ online submissions for Maximum Product Subarray.
Memory Usage: 8.5 MB, less than 100.00% of C++ online submissions for Maximum Product Subarray.*/
int maxProduct(vector<int>& nums) {
	int maxnow = nums[0], minnow = nums[0];
	int res = nums[0];
	for (int i = 1; i < nums.size(); i++) {
		if (nums[i] > 0) {
			maxnow = max(nums[i], nums[i] * maxnow);
			minnow = min(nums[i], nums[i] * minnow);
		}
		else {
			int maxx = maxnow;
			maxnow = max(nums[i], nums[i] * minnow);
			minnow = min(nums[i], nums[i] * maxx);
		}
		res = max(res, maxnow);
	}
	return res;
}
int main() {
	vector<int> num = { 2,3,-2,4 };
	int res = maxProduct(num);
	cout << res << endl;
	return 0;
}

 

Li_JiaQian
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
LeetCode字符串换行-CodeFormatter:格式化为我在竞争性编程解决方案中遵循的一致风格
06-30
LeetCode字符串换行代码格式化程序 将源代码格式化为我在竞争性编程解决方案源文件中遵循的一致样式。 以下操作会自动应用于源文件， 标签更换 缩进修复（内部/外部注释） 评论风格修复 此外，它还支持模拟或noop 。...
最长公共子序列<DP>
yeleng的博客
05-04 236
dp[i][j]表示s1序列到i个字符，s2序列到j个字符的最长公共子序列有长。 for i=1 to l1  for j=1 to l2  if(s1[i]==s2[j])dp[i][j]=dp[i-1][j-1]         Q1为什么不能是dp[i-1][j]    dp[i][j-1] else dp[i][j]=max(dp[i-1][j],dp[i][j-1] Q1因为
动态规划的总结分析
wjhshuai的博客
01-15 311
专题总结之——动态规划 动规学了这么长时间，结果觉得自己其实并没有什么长进，但自己好歹也做了几道经典动规， 那么我们就要来总结一下 先总结一下那些经典例题 （1）01背包问题问题 想法思路； 1.动规要把大问题化成小问题，那么我们就把物品一个一个加入背包，一件物品只有两种情况，加，或者不加 如果要加，那肯定是在上个状态的最优解的情况下加， 能加的情况下上一状态就是 背包体积为 当前体
字符串的表示形式
SOHOCODE
12-26 3125
字符串的表示形式 1 输入字符串中N个字符后的所有字符； #include int main() {  char *string="i love china!";  int n=7;  string=string+n;  printf("%s\n",string);  return 0; } 解释 字符串的首地址赋予给了string，string=string+7；就指向了
Code69 输出字符串中数字字符
夜晚回家
07-28 813
<br />下面代码显示如何从带数字字符串中输出数字字符。<br />public static string StripNumbers(string Value) {<br />    StringBuilder stringbuilder = new StringBuilder(); <br />    if(Value != string.Empty || Value != null) {<br />        foreach(char a in Value) { <br /> 
通过字符串模板生成字符串[附源码]
Codefan的博客
11-08 799
其模板为一个字符串，并对其中的 { 变量表达式 }内部的内容进行替换，其中用“\”作为转义符；变量表达式类似于jsp中的el表达式。这个功能比较单一，直接用使用示例来展示。
cleancode:leetcode的cleancode
06-07
干净的代码 ...字符串转整数 有效回文 最长回文子串 最多两个不同字符的最长子串 无重复字符的最长子串 一编辑距离 读取给定的 N 个字符 Read4 反转字符串中的单词 旋转字符串 实现 strStr() 有效号码
Online-Judge-Code:在线裁判代码
04-06
在编写代码之前对其进行良好的测试永远不要连续提交代码一个简单问题的局限是比赛期间30分钟一个难题的限制是比赛后1天（如果没有新的想法就停止思考）如何更快地解决问题在字符串中找到模式（D.最小欧拉周期）[ ] ...
leetcode数组下标大于间距-happen-code:进入Leetcode~
06-30
leetcode数组下标大于间距 happen-code Get into Leetcode~ Code List 动态规划 动态规划（英语：Dynamic programming，简称 DP）是一种在数学、管理科学、计算机...一共有$2n-1$个中心点，需要考虑字符串长度的奇偶性
leetcode安卓-301-Days-Of-Code:此存储库包含我连续301天执行的编码活动和任务的日常记录
06-30
代码字符串问题 Prefix 到 Infix 和 Infix 到 Postfix 的转换。 代码链接： 代码链接： 第 2 天：2020 年 8 月 2 日 使用递归的 Code Min 硬币变化问题通过使用记忆和制表技术的动态编程进一步优化了它。 代码链接：...
【CODE】01 矩阵（01 Matrix）
Li_Jiaqian的博客
04-15 1979
542. 01 矩阵 难度中等192收藏分享切换为英文关注反馈 给定一个由 0 和 1 组成的矩阵，找出每个元素到最近的 0 的距离。 两个相邻元素间的距离为 1 。 示例 1: 输入: 0 0 0 0 1 0 0 0 0 输出: 0 0 0 0 1 0 0 0 0 示例 2: 输入: 0 0 0 0 1 0 1 1 1 输出: 0 0 0 0 1 0 1 2 ...
【CODE】nSum问题
Li_Jiaqian的博客
03-02 991
目录 1.Two Sum 15.3Sum 16.3Sum Closest 259. 3Sum Smaller 923.3Sum With Multiplicity 18.4Sum 454.4Sum II 1.Two Sum Easy 13693502Add to ListShare Given an array of integers, returnindi...
【CODE】CoderPad——树
Li_Jiaqian的博客
02-20 833
目录 1.递归层序/先序/中序/后序遍历二叉树 2.非递归先序/中序/后序遍历二叉树 3.递归/非递归产生二叉树的镜像 4.二叉树叶子节点个数/二叉树第k（从1开始）层节点数 5.树的高度 6.二叉树的最小深度 7.判断是否是完全二叉树 8.判断两个数是否相同/是否互为镜像 9.判断一个树是否是另一个树的子树 10.二叉树中两节点间最长距离 11.判断是否是二叉搜索树 12...
【综合】一些春招实习面经和碎碎念
Li_Jiaqian的博客
04-03 802
写在前面的话。 C++，两年半专硕，投了好些家，完结撒花，专心搞毕设了。（牛客真的蛮灵，3月27日发了第一篇面经后，开始变得顺起来）（大伙不要喷我，我的本意不是“面霸”，只是希望有位爸爸能够收留） B站 2020/1/3-电话面 用户态和内核态的区别 用户态和内核态切换的代价 环形缓冲区的好处 如果多个用户读同一个缓存环 互斥锁 TCP四次挥手 Alloc，c语言内存管理 S...
【CODE】CoderPad——单链表
Li_Jiaqian的博客
02-14 782
1.单链表反转 #include<iostream> #include<stdlib.h> using namespace std; typedef struct ListNode{ int value; ListNode *next; }ListNode; void print(ListNode *head){ while(head!=NULL){ ...
【CODE】设计推特（Design Twitter）
Li_Jiaqian的博客
04-13 687
355. 设计推特 难度中等72收藏分享切换为英文关注反馈 设计一个简化版的推特(Twitter)，可以让用户实现发送推文，关注/取消关注其他用户，能够看见关注人（包括自己）的最近十条推文。你的设计需要支持以下的几个功能： postTweet(userId, tweetId): 创建一条新的推文 getNewsFeed(userId): 检索最近的十条推文。每个推文都必须是由此用户关注的人...
【CODE】滑动窗口的最大值 & 最大子序和
Li_Jiaqian的博客
05-03 685
滑动窗口的最大值 给定一个数组和滑动窗口的大小，找出所有滑动窗口里数值的最大值。例如，如果输入数组{2,3,4,2,6,2,5,1}及滑动窗口的大小3，那么一共存在6个滑动窗口，他们的最大值分别为{4,4,6,6,6,5}； 针对数组{2,3,4,2,6,2,5,1}的滑动窗口有以下6个： {[2,3,4],2,6,2,5,1}， {2,[3,4,2],6,2,5,1}， {2,3,[4,2,6...
【CODE】二分查找 && 二维矩阵问题 && 螺旋矩阵 && 中位数
Li_Jiaqian的博客
03-04 669
目录 475.Heaters 441.Arranging Coins 363.Max Sum of Rectangle No Larger Than K 240.Search a 2D Matrix II 74.Search a 2D Matrix 54.Spiral Matrix 59.Spiral Matrix II 73.Set Matrix Zeroes ...
【CODE】线段交点—Intersection LCCI
Li_Jiaqian的博客
04-12 489
面试题 16.03. 交点 难度困难17收藏分享切换为英文关注反馈 给定两条线段（表示为起点start = {X1, Y1}和终点end = {X2, Y2}），如果它们有交点，请计算其交点，没有交点则返回空值。 要求浮点型误差不超过10^-6。若有多个交点（线段重叠）则返回 X 值最小的点，X 坐标相同则返回 Y 值最小的点。 示例 1： 输入：line1 = {0, 0}, {1,...
php正则表达式匹配code字符串
最新发布
06-03
如果要匹配一个字符串中的所有 code 字符串，可以使用以下代码： ``` $string = "Some code examples: <code>echo 'Hello World';</code> and <code>$x = 5;</code>"; preg_match_all('/<code>(.*?)<\/code>/', $...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值