definition

LeetCode#205 Isomorphic Strings

Problem Definition: Given two strings s and t, determine if they are isomorphic.
·2015-07-17 13:00

leetcode：Lowest Common Ancestor of a Binary Search Tree

According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined bet
·2015-07-17 10:00

JSON与XML比较

XML使用DTD(document type definition)文档类型定义来组织数据;格式统一，跨平台和语言，早已成为业界公认的标准。XML是标准通
·2015-07-17 09:00

LeetCode#219 Contains Duplicate II

Problem Definition: 　　Given an array of integers and an integer k, find out whether there there are
·2015-07-16 20:00

Reverse Linked List

  /** * Definition for singly-linked list.
hcx2013·2015-07-16 20:00

LeetCode#217 Contains Duplicate

Problem Definition: 　　Given an array of integers, find if the array contains any duplicates.
·2015-07-16 17:00

LeetCode#226 Invert Binary Tree

Problem Definition:　　 　　Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9
·2015-07-16 12:00

LeetCode#228 Summary Ranges

Problem Definition: 　　Given a sorted integer array without duplicates, return the summary of its ranges
·2015-07-16 11:00

Spring 3.1 M1: Unified Property Management

In the first two posts of this series, I described the bean definition profiles 
·2015-07-16 11:00

LeetCode#231 Power of Two

Problem Definition: 　　Given an integer, write a function to determine if it is a power of two.
·2015-07-15 21:00

LeetCode#234 Palindrome Linked List

Problem Definition: 　　Given a singly linked list, determine if it is a palindrome. 　　
·2015-07-15 19:00

LeetCode#235 Lowest Common Ancestor of a Binary Search Tree

Problem Definition: 　　Given a binary search tree (BST), find the lowest common ancestor (LCA) of two
·2015-07-15 16:00

LeetCode#237 Delete Node in a Linked List

Problem Definition: 　　Write a function to delete a node (except the tail) in a singly linked list, given
·2015-07-15 16:00

Python 背景色与语法高亮主题配置

下面介绍Obsidian,Desert,和Tango三种主题配置在用户目录的.idlerc目录下新建名为config-highlight.cfg文件，并加入如下内容[tango] definition-foreground
u012675539·2015-07-14 17:00

详解Java解析XML的四种方法

对于XML本身的语法知识与技术细节,需要阅读相关的技术文献,这里面包括的内容有DOM(Document Object Model),DTD(Document Type Definition),SAX(Simple
hq82001·2015-07-13 12:00

poj 1679 次小生成树

Definition1(SpanningTree):Consideraconnected,undirectedgraphG=(V,E).AspanningtreeofGisasub
u013573047·2015-07-13 11:00

[LeetCode] Lowest Common Ancestor of a Binary Tree 二叉树的最小共同父节点

According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between
·2015-07-13 07:00

[LeetCode] Lowest Common Ancestor of a Binary Search Tree 二叉搜索树的最小共同父节点

According to the definition of LCA on Wikipedia: “The lowest common ancestor is def
·2015-07-12 10:00

[LintCode] 最多有多少个点在一条直线上

1 /** 2 * Definition for a point. 3 * struct Point { 4 * int x; 5 * int y; 6
·2015-07-11 21:00

mysql 数据表的修改

添加单列    ALTER TABLE tbl_name ADD [COLUMN] col_name column_definition [FIRST|AFTER col_name
zhizhi555555·2015-07-11 00:00

Sort List 分类： leetcode 算法 2015-07-10 15:35 1人阅读 评论(0) 收藏

我一开始的想法是借助quicksort的思想，代码如下： # time O(nlog(n)) # Definition for singly-linked list. class ListNode:
·2015-07-10 15:00

[leetcode] Reverse Linked List 分类： leetcode 算法 2015-07-09 18:44 2人阅读 评论(0) 收藏

# Definition for singly-linked list. class ListNode: def __init__(self, x): self.val = x
·2015-07-09 18:00

合并k个已排序的链表 分类： leetcode 算法 2015-07-09 17:43 3人阅读 评论(0) 收藏

class ListNode:# Definition for singly-linked list.
·2015-07-09 17:00

Nim教程【十五】【完结】

=` (a, b: expr): expr =   # this definition&n
·2015-07-08 19:00

【转】JSON与XML的区别比较

XML使用DTD(document type definition)文档类型定义来组织数据;格式统一，跨平台和语言，早已成为业界公认的标准。 XML是标
丁_新·2015-07-08 19:00

[LintCode] 删除链表中倒数第n个节点

1 /** 2 * Definition of ListNode 3 * class ListNode { 4 * public: 5 * int val; 6
·2015-07-07 21:00

[LintCode] 在O(1)时间复杂度删除链表节点

1 /** 2 * Definition of ListNode 3 * class ListNode { 4 * public: 5 * int val; 6
·2015-07-07 20:00

[LintCode] 链表插入排序

1 /** 2 * Definition of ListNode 3 * class ListNode { 4 * public: 5 * int val; 6
·2015-06-29 23:00

Balanced Binary Tree

aheight-balancedbinarytreeisdefinedasabinarytreeinwhichthedepthofthetwosubtreesofeverynodeneverdifferbymorethan1.解决方案：/***Definition
LeoSha·2015-06-29 19:49

[LintCode] 二叉树的后序遍历

Iterative Solution using Stack (O(n) time and O(n) space): 1 /** 2 * Definition
·2015-06-29 17:00

[LintCode] 二叉树的中序遍历

Iterative Solution using Stack (O(n) time and O(n) space): 1 /** 2 * Definition
·2015-06-29 16:00

[LintCode] 二叉树的前序遍历

Iterative Solution using Stack (O(n) time and O(n) space): 1 /** 2 * Definition of TreeNode:
·2015-06-29 15:00

代码大全（第二版）——全面的软件构建参考 第一部分：打好基础

第一部分：打好基础1、软件开发中的不同活动a) 定义问题（Problem definition）b) 需求分析（Requirements development）c) 规划构建（Construction
天下第三·2015-06-29 13:00

[LintCode] 拓扑排序

BFS: 1 /** 2 * Definition for Directed graph. 3 * struct DirectedGraphNode { 4 * int
·2015-06-28 23:00

[LintCode] 翻转二叉树

递归实现： 1 /** 2 * Definition of TreeNode: 3 * class TreeNode { 4 * public: 5 * int val
·2015-06-28 15:00

互联网时代高清视频直播系统的应用

高清，英文为“High Definition”。高清是相对于标清格式而言的，标清格式通常是指分辨率在D1（PAL：720×576、NTSC：720×480）以下的视频分辨率。
VIEWGOOD·2015-06-26 17:00

MySQL—基础（SQL语句）

SQL语句： DDL（Data Definition Languages）语句：数据定义语言；操作对象：数据段、数据库、表、列、索引等。 　　　　
·2015-06-21 22:00

Merge Intervals

  /** * Definition for an interval. *
hcx2013·2015-06-20 13:00

mysql 5.6 内存 占用过多

修改my.cnf配置文件performance_schema_max_table_instances=400 table_definition_cache=400 table_open_cache=256
古世界·2015-06-20 11:00

mysql 5.6 内存 占用过多

修改my.cnf配置文件performance_schema_max_table_instances=400 table_definition_cache=400 table_open_cache=256
古世界·2015-06-20 11:00

补丁信息传递

补丁信息传递   /usr/local/qt/qt5.4.0/lib/libQt5WebKit.a(JavaScriptCore_JIT.o):(.bss+0x0): multiple definition
·2015-06-20 10:00

leetcode：Reverse Linked List

  代码如下： the iterative solution：（c++） /** * Definition for singly-linked list.
·2015-06-19 22:00

[LeetCode-JAVA] Count Complete Tree Nodes

Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, except
·2015-06-19 11:00

gRPC

支持主流开发语言（C, C++, Python, PHP, Ruby, NodeJS, C#, Objective-C、Golang、Java） IDL (Interface Definition
·2015-06-19 09:00

leetcode：Invert Binary Tree

/ \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1即反转二叉树，代码如下： /** * Definition
·2015-06-16 11:00

[置顶] WebLogic(12C)—NetWork Channel

1，Definition  InWebLogic，aserverinstanceneednotbeboundasinglenetworkaddress,orasingleportnumber/secureport.Anetworkchannelprovidesthisfunctionality.Anetworkchannelisaconfigurableresourcethatdefinesthe
hanxuemin12345·2015-06-14 15:00

Copy List with Random Pointer

  /** * Definition for sin
hcx2013·2015-06-14 11:00

利用XSD 验证XML文件

XSD文件 （XML Schema 语言也称作 XML Schema 定义（XML Schema Definition，XSD）。
newerdragon·2015-06-10 16:00

Leetcode - Count Complete Tree Nodes

Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, except
likesky3·2015-06-07 20:00

LeetCode 222 - Count Complete Tree Nodes

Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, except
yuanhsh·2015-06-06 06:00
上一页 47 48 49 50 51 52 53 54 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他