码迷,mamicode.com
首页 >  
搜索关键字:definition    ( 2735个结果
DML、DDL、DCL区别
总体解释:DML(data manipulation language): 它们是SELECT、UPDATE、INSERT、DELETE,就象它的名字一样,这4条命令是用来对数据库里的数据进行操作的语言DDL(data definition language): DDL比DML要多,主要的命令有CR...
分类:其他好文   时间:2014-10-21 15:20:58    阅读次数:214
[Leetcode] Convert Sorted List to Binary Search Tree
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. 1 /** 2 * Definition for singly-linked ....
分类:其他好文   时间:2014-10-21 03:33:45    阅读次数:168
[LeetCode]Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. /** * Definition for singly-linked list. * publ...
分类:其他好文   时间:2014-10-20 21:28:05    阅读次数:233
Linked List Cycle
Linked List CycleGiven a linked list, determine if it has a cycle in it.c++/** * Definition for singly-linked list. * struct ListNode { * int val;...
分类:其他好文   时间:2014-10-19 23:04:39    阅读次数:206
Max Points on a Line
Max Points on a LineGivennpoints on a 2D plane, find the maximum number of points that lie on the same straight line.c++版本:/** * Definition for a poi....
分类:其他好文   时间:2014-10-19 22:42:21    阅读次数:225
Path Sum
1 /** 2 * Definition for binary tree 3 * public class TreeNode { 4 * int val; 5 * TreeNode left; 6 * TreeNode right; 7 * TreeNo...
分类:其他好文   时间:2014-10-19 21:11:49    阅读次数:189
leetcode:Minimum Depth of Binary Tree【Python版】
1、类中递归调用添加self;2、root为None,返回03、root不为None,root左右孩子为None,返回14、返回l和r最小深度,l和r初始为极大值; 1 # Definition for a binary tree node 2 # class TreeNode: 3 # ...
分类:编程语言   时间:2014-10-19 10:13:07    阅读次数:222
leetcode:Path Sum【Python版】
1、类中递归调用函数需要加self# Definition for a binary tree node# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# ...
分类:编程语言   时间:2014-10-19 10:11:52    阅读次数:200
SharePoint快速入门(3)之List Definition
第一次接触sharepoint的同学,可以把list等同于数据库中的table. 它是sharepoint中最主要也是最常用的数据存储容器。本节学习目标:如何定义ListSharepoint 中定义List有2种方式:通过页面可视化创建(对于初学者可以加深对List理解)和通过VS定义(开发模式),...
分类:其他好文   时间:2014-10-19 10:10:38    阅读次数:138
leetcode:Same Tree【Python版】
1、p或q为None的情况用开始的两个if语句进行判断;2、类中递归调用函数需要使用self进行调用;3、代码很简洁,最后几行通过同时为None和同时非None的条件进行判断; 1 # Definition for a binary tree node 2 # class TreeNode: 3 ....
分类:编程语言   时间:2014-10-19 01:17:13    阅读次数:329
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!