Given an array of integers and an integer k,
find out whether there there are two distinct indices i and j in
the array such that nums[i] = nums[j] and
the difference between iand j is
at most...
分类:
其他好文 时间:
2015-06-25 09:00:59
阅读次数:
82
题目
Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find tw...
分类:
其他好文 时间:
2015-06-25 09:00:28
阅读次数:
135
Oracle Key Flexfields Qualifiers 1. Application Developer è Flexfield è Key è Register Title: Accounting Flexfield Click button [Find] Click button [Q...
分类:
数据库 时间:
2015-06-25 08:53:58
阅读次数:
198
Kc.find({bjid:req.params.bjid}).sort({'_id':1}).exec(function(err,kcs){ if(err){ res.json({no:0,msg:err}); }else{ var result = {no:1};...
分类:
编程语言 时间:
2015-06-25 08:53:30
阅读次数:
147
Description:Given an array of integers, every element appears twice except for one. Find that single one.找出只出现一次的数。public class Solution { public i...
分类:
其他好文 时间:
2015-06-25 00:06:10
阅读次数:
179
1. Question求二叉树的最大深度。Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node do...
分类:
其他好文 时间:
2015-06-25 00:00:30
阅读次数:
281
一,用户操作:1. #进入数据库adminuse admin2. #增加或修改用户密码db.addUser('name','pwd')3. #查看用户列表db.system.users.find()4. #用户认证db.auth('name','pwd')5. #删除用户db.removeUser(...
分类:
数据库 时间:
2015-06-24 23:46:52
阅读次数:
274
#104 Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node...
分类:
其他好文 时间:
2015-06-24 22:38:28
阅读次数:
164
Given an array of sizen, find the majority element. The majority element is the element that appears more than? n/2 ?times.You may assume that the arr...
分类:
其他好文 时间:
2015-06-24 20:57:55
阅读次数:
269
最近要使用django进行项目开发,需要使用mysql-python模块。在本地搭建环境安装的时候却出现报错,Unable to find vcvarsall.bat在网上找了很多资料,发现是window平台本身不带编译系统,而安装mysql-python需要进行编译。网上给出的办法是,安装vs20...
分类:
数据库 时间:
2015-06-24 20:51:15
阅读次数:
247