码迷,mamicode.com
首页 >  
搜索关键字:which    ( 9148个结果
[leetcode] Balanced Binary Tree
Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth...
分类:其他好文   时间:2014-05-01 14:38:39    阅读次数:454
Accessing and Updating Data in ASP.NET: Retrieving XML Data with XmlDataSource Control
XmlDataSource BasicsThe XmlDataSource control exists merely as a proxy for retrieving XML data, which can then be programmatically accessed or bound t...
分类:数据库   时间:2014-04-30 19:04:56    阅读次数:727
[LeetCode] 4Sum
Given an arraySofnintegers, are there elementsa,b,c, anddinSsuch thata+b+c+d= target? Find all unique quadruplets in the array which gives the sum of ...
分类:其他好文   时间:2014-04-29 22:40:00    阅读次数:438
Leetcode:Minimum Path Sum 最小路径和
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move either down or right at...
分类:其他好文   时间:2014-04-28 10:46:41    阅读次数:311
《Cracking the Coding Interview》——第16章:线程与锁——题目4
2014-04-27 20:06题目:设计一个类,只有在不产生死锁的时候才分配资源。解法:不太清楚这个题是要分配何种资源,以何种形式?所以没能动手写个可运行的代码,只是闲扯了几句理论分析。代码: 1 // 16.4 Design a class which provides a lock only ...
分类:编程语言   时间:2014-04-28 01:21:58    阅读次数:558
sdut 2413:n a^o7 !(第三届山东省省赛原题,水题,字符串处理)
n a^o7 !Time Limit: 1000MS Memory limit: 65536K题目描述All brave and intelligent fighters, next you will step into a distinctive battleground which is ful...
分类:其他好文   时间:2014-04-27 21:01:45    阅读次数:529
[Leetcode] 4Sum
Given an arraySofnintegers, are there elementsa,b,c, anddinSsuch thata+b+c+d= target? Find all unique quadruplets in the array which gives the sum of ...
分类:其他好文   时间:2014-04-27 20:55:03    阅读次数:567
[2012山东ACM省赛] n a^o7 !(模拟,字符替换)
n a^o7 ! Time Limit: 1000MS Memory limit: 65536K 题目描述 All brave and intelligent fighters, next you will step into a distinctive battleground which is full of sweet and happiness. If you wan...
分类:其他好文   时间:2014-04-27 19:31:28    阅读次数:598
9148条   上一页 1 ... 913 914 915
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!