oracle version:Oracle Database 11g Enterprise Edition Release 11.2.0.1.0 - 64bit Production os version:Linux x86 64-bit oracle alert日志报错： opiodr abort
转载
2018-03-31 18:40:00
891阅读
2评论
关于Oracle 11.2.0.4（11g） DG库的BUG，ORA-04021，ORA-1092
原创
2020-04-20 22:17:07
1735阅读
今天安装Oracle10.2.0.4碰到的错误。新机器先安装10.2.0.1，安装完后先创建数据库后再升级到10.2.0.4.升级过程都没问题，可是在启动数据库就报错。错误如下ORA-01092: ORACLE instance terminated.Disconnection forced解决方法：SolutionTo implement the solution, please
转载
精选
2013-12-28 21:33:32
4926阅读
1092. To Buy or Not to Buy (20)时间限制100 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueEva would like to make a string of be
原创
2022-08-30 10:27:07
48阅读
public String shortestCommonSupersequence(String str1, String str2) {
char[] arr1 = str1.toCharArray();
char[] arr2 = str2.toCharArray();
int m = arr1.length;
int n = arr2.length;
原创
2024-08-21 15:07:58
27阅读
# 如何实现“ZZULIOJ 1092 JAVA”
## 1. 整件事情的流程
首先，我们需要了解“ZZULIOJ 1092 JAVA”是一个什么样的题目，然后按照以下流程来实现：
```mermaid
gantt
title 实现“ZZULIOJ 1092 JAVA”流程
section 理解题目: 10:00, 2h
section 编写代码: 12:00, 3h
原创
2024-04-27 06:27:23
15阅读
1 class Solution:
2 def __init__(self):
3 self.dp = []
4 self.b = []
5 self.LCStr = ''
6 self.stridx1 = []
7 self.stridx2 = []
8
9 def LCS(se
转载
2019-06-16 21:08:00
28阅读
题目链接 这个题主要卡在散列上（hashmap） 其实可以直接用map(char,int) 尝试了一下用c自己手动构造hashmap的过程 attention:如果是普通的数组，str[i]中的这个i一定要是个Int 本题中的散列思想主要是，既然只有[0~9][a~z][A~Z]，那我们可以把它对应 ...
转载
2021-07-17 18:07:00
27阅读
2评论
The Fibonacci Numbers{0,1,1,2,3,5,8,13,21,34,55...} are defined by the recurrence: F0=0 F1=1 Fn=Fn-1+Fn-2,n>=2 Write a program to calculate the Fibona
转载
2018-10-02 10:22:00
49阅读
2评论
A+B for Input-Output Practice (IV)：#include<iostream>
using namespace std;
int main(){
int n;
while(cin>>n&&n){
int i;
int sum=0;
int m;
原创
2013-07-27 17:52:47
1322阅读
Given two strings str1 and str2, return the shortest string that has both str1 and str2 as subsequences. If multiple answers exist, you may return any
转载
2020-07-28 09:37:00
189阅读
2评论
vijosP1092 全排列链接：https://vijos.org/p/1092【思路】 数学+搜索。 根据序号依次确定每一个数。 首先我们可以把未选的数看作一个可选择集合，其次把寻找过程看作一棵树上的操作，如果有n个数我们已经确定了d个数，那么无论第d+1个数为多少以当前可选择集合中的任意一个数...
转载
2015-10-13 15:51:00
50阅读
2评论
题目#include<iostream>#include<algorithm>using namespace std;struct ss { int num; int sale=0;};bool cmp(struct ss a,struct ss b ) { return a.sale==b.sale?a.num<b.num:a.sale>...
原创
2023-06-27 10:18:23
103阅读
1092To Buy or Not to Buy(20分)Eva would like to make a string of beads with her
原创
2022-09-19 15:41:04
89阅读
Eva would like to make a string of beads with her favorite colors so she went to a small shop to buy some beads. There were many colorful strings of b
转载
2018-03-25 15:49:00
87阅读
#include<iostream>#include<stdio.h>#include<stdlib.h>#include<math.h>#include<cstring>#include<string>#include<algorithm> #include<map>#includ...
原创
2022-07-14 10:25:00
28阅读
ArbitrageTime Limit: 2 Seconds Memory Limit: 65536 KBArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buys 0.5 British pound, 1 British pound buys 10.0 French fr...
原创
2021-07-29 16:22:42
136阅读
