码迷,mamicode.com
首页 >  
搜索关键字:unique constraint    ( 5568个结果
约束(主键、非空、唯一性、外键、检查约束)
一、五种约束如果DML操作所涉及数据违反了已定义的约束,则数据库系统将拒绝执行这样的操作。Oracle数据库中,约束具体包括非空(NOT NULL)约束、唯一键(UNIQUE)约束、主键(PRIMARY KEY)约束、外键(FOREIGN KEY)约束和检查(CHECK)约束五种。和数据表类似,约束...
分类:其他好文   时间:2014-05-19 08:45:03    阅读次数:368
【leetcode】Longest Palindromic Substring
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa...
分类:其他好文   时间:2014-05-18 19:39:55    阅读次数:355
Leetcode | Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longes...
分类:其他好文   时间:2014-05-16 21:15:37    阅读次数:454
[LeetCode]3Sum
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero....
分类:其他好文   时间:2014-05-16 01:34:36    阅读次数:293
mysql workbench建表时PK,NN,UQ,BIN,UN,ZF,AI
[intrinsic column flags] (基本字段类型标识)- PK: primary key (column is part of a pk) 主键- NN: not null (column is nullable) 非空- UQ: unique (column is part of ...
分类:数据库   时间:2014-05-15 14:27:20    阅读次数:301
Leetcode 树 Unique Binary Search TreesII
本文为senlie原创,转载请保留此地址:http://blog.csdn.net/zhengsenlie Unique Binary Search Trees II  Total Accepted: 7349 Total Submissions: 27648 Given n, generate all structurally unique ...
分类:其他好文   时间:2014-05-15 07:02:36    阅读次数:252
LeetCode-005 Longest Palindromic Substrin
【题目】 Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. 【题意】 题意是找出字符串S中最长回文子串,S最长为1000,保证有唯一解 【思路】 原字符串用特殊字符#间隔,如下所示: #a...
分类:其他好文   时间:2014-05-15 03:31:25    阅读次数:299
LeetCode之Unique Binary Search Trees
Unique Binary Search Trees, Given n, how many structurally unique BST's (binary search trees) that store values 1...n?...
分类:其他好文   时间:2014-05-15 02:32:11    阅读次数:245
Leetcode: Unique Paths
这道题最开始采用recursive的方法,结果犯了TLE(time limit exceeded)的错误,事实证明recursive的时间代价还是太高,所以改用DP的方法,把曾经算出来的结果存起来,我用的是一个M*N的matrix来存储 1 public class Solution { 2 ...
分类:其他好文   时间:2014-05-14 10:57:31    阅读次数:245
Leetcode 树 Unique Binary Search Trees
本文为senlie原创,转载请保留此地址:http://blog.csdn.net/zhengsenlie Unique Binary Search Trees  Total Accepted: 13478 Total Submissions: 37858 Given n, how many structurally unique BST's (bin...
分类:其他好文   时间:2014-05-13 15:21:22    阅读次数:291
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!