码迷,mamicode.com
首页 >  
搜索关键字:solution upgrade    ( 13024个结果
Zero Downtime Upgrade of Oracle 10g to Oracle 11g Using GoldenGate — 4
Target Side Setup Install OGG on Target Side Creates required directories for OGG [oracle@vzwc1 ggs]$ ./ggsci  Oracle GoldenGate Command Interpreter for Oracle Version 11.2.1.0.23 1870940...
分类:数据库   时间:2014-06-18 12:37:31    阅读次数:442
【Leetcode】Set Matrix Zeroes
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. Could you devise a constant space solution? 思路:因为需要遍历整个矩阵,时间复杂度肯定需要O(m * n),对于空间复杂度而言,第一种是可以使用O(m * n),...
分类:其他好文   时间:2014-06-18 12:33:39    阅读次数:167
Zero Downtime Upgrade of Oracle 10g to Oracle 11g Using GoldenGate — 1
Source Database DB Name:        zwc Schemas:         HR,OE,PM Version:          10.2.0.4 RAC:                No OS Version:     Red Hat Enterprise Linux Server release 5.9 x86_64 OGG...
分类:数据库   时间:2014-06-18 12:09:56    阅读次数:617
【Leetcode】Combinations
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example, If n = 4 and k = 2, a solution is: [ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4], ]...
分类:其他好文   时间:2014-06-18 11:41:52    阅读次数:156
LeetCode: Generate Parentheses 题解
Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))...
分类:其他好文   时间:2014-06-18 11:15:22    阅读次数:149
LeetCode:Subsets
Given a set of distinct integers, S, return all possible subsets. Note: Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets. For example, ...
分类:其他好文   时间:2014-06-18 00:39:26    阅读次数:301
Zero Downtime Upgrade of Oracle 10g to Oracle 11g Using GoldenGate — 3
DDL Setup Steps SQL> grant execute on utl_file to ggs; Grant succeeded.   Create GLOBALS file [oracle@zwc ~]$ cd /ggs/ [oracle@zwc ggs]$ cat GLOBALS  GGSCHEMA GGS   run marker_s...
分类:数据库   时间:2014-06-17 23:24:30    阅读次数:534
Generate Parentheses
题目 Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: "((()))", "(()())", "(())()", "()...
分类:其他好文   时间:2014-06-17 22:59:06    阅读次数:223
Zero Downtime Upgrade of Oracle 10g to Oracle 11g Using GoldenGate — 2
Prepare 10g Database for OGG Create GGS and GGS_MON Database Users SQL> create tablespace ggs_tbs datafile '/u01/app/oracle/oradata/zwc/gg_tbs01.dbf' size 100M; Tablespace created. SQL> cr...
分类:数据库   时间:2014-06-17 22:24:12    阅读次数:334
[LeetCode] Combinations [38]
题目 Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example, If n = 4 and k = 2, a solution is: [ [2,4], [3,4], [2,3], [1,2], [1,3],...
分类:其他好文   时间:2014-06-15 14:10:54    阅读次数:239
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!