- 博客(13)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 MongoDB增删改查（三）
Insert Documents插入单个document到collection中. db.inventory.insertOne( { item: “canvas”, qty: 100, tags: [“cotton”], size: { h: 28, w: 35.5, uom: “cm” } } )插入多个document到collection中 db.inventor
2017-06-19 09:31:41
1886
原创 MongoDB常用操作（二）
下载MongoDB 进到官网下载你需要的MondoDB版本，这里我们现在mongodb-win32-x86_64-2008plus-ssl-3.2.13.zip这个版本。安装MongoDB把下载后的zip压缩包解压，进入到bin目录下，鼠标右指键此处命令行打开，或者在系统的环境变量path下配置bin的路径。启动MongoDB在启动MongoDB之前，要手动创建一个存放MongoDB数据文件的目录
2017-06-18 11:40:53
525
原创 MongoDB简介和基本概念（一）
NoSQL简介 NoSQL(Not Only SQL )，意即“不仅仅是SQL” ,指的是非关系型的数据库 。是一项全新的数据库革命性运动，早期就有人提出，发展至2009年趋势越发高涨。NoSQL的拥护者们提倡运用非关系型的数据存储，相对于铺天盖地的关系型数据库运用，这一概念无疑是一种全新的思维的注入。 关系型数据库中的表都是存储一些结构化的数据，每条记录的字段的组成都一样，即使不是每条记
2017-06-16 11:56:26
9340
1
原创 remove-duplicates-from-sorted-array
题目描述 Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this in plac
2017-06-05 23:02:40
244
原创 remove element
题目描述 Given an array and a value, remove all instances of that value in place and return the new length. The order of elements can be changed. It doesn’t matter what you leave beyond the new length
2017-06-05 22:48:41
229
原创 Next Permutation
题目描述 Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as the lowest po
2017-06-05 22:37:20
213
原创 first-missing-positive
题目描述 Given an unsorted integer array, find the first missing positive integer. For example, Given[1,2,0]return3, and[3,4,-1,1]return2. Your algorithm should run in O(n) time and uses cons
2017-06-05 18:50:22
195
原创 旋转二维数组90度
题目You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?java实现public void rotate(int[][] matrix) { int row =
2017-06-05 15:51:33
575
原创 spiral-matrix
题目描述Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]You sh
2017-06-05 14:54:28
273
原创 merge-intervals
题目描述 Given a collection of intervals, merge all overlapping intervals. For example, Given[1,3],[2,6],[8,10],[15,18], return[1,6],[8,10],[15,18].java实现public ArrayList<Interval> merge(ArrayL
2017-06-05 12:23:33
266
原创 plus-one
题目描述 Given a number represented as an array of digits, plus one to the number.分析digits数组代表一个大整数，将这个大整数加1.如果末尾位上的数小于9，直接将该位加1.如果末尾位置上的数大于9，将该位置0，产生进位。public int[] plusOne(int[] digits) { for
2017-06-05 10:53:04
228
原创 search-a-2d-matrix
题目描述Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each row
2017-06-04 22:20:59
236
原创 sorts-colors
题目：Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers 0
2017-06-04 21:49:59
192
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人