E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
geeks
贪心算法(2)-Kruskal最小生成树
原文地址 http://www.acmerblog.com/greedy-kruskal-spanning-tree-mst-5326.html参考地址 http://www.
geeks
for
geeks
.org
a2459956664
·
2015-12-20 08:00
how to create shortcut on home screen
NoteveryAndroiddevice'susersare
geeks
,itwouldbenicetoprovideshortcutsonhomescreenwhenyourappinstlled.Aftersearchingforawhile
windblowrain
·
2015-12-18 11:00
微服务架构的设计模式
前不久,JavaCode
Geeks
发表了一篇文章,分析单体应用与微服务的优缺点。近日,该网站又发表了一篇文章,提供了六种微服务架构的设计模式。
Stubborn_Cow
·
2015-12-13 22:00
Zend Studio 10正式版注册破解
1.文件和汉化文件ZendStudio官方下载地址:http://www.
geeks
o.com/component/zendstudio-downloads/ 百度云地址:10.0.0.msi文件: http
·
2015-12-09 10:46
Zend
leetcode -- Implement strStr() -- KMP难理解,但考得不多,知道就好
ref:http://wiki.jikexueyuan.com/project/kmp-algorithm/define.html参考这个codehttp://www.
geeks
for
geeks
.org
xyqzki
·
2015-12-08 20:00
LeetCode
转 -- How To Repair Corrupted MySQL Tables Using myisamchk
原址如下:http://www.the
geeks
tuff.com/2008/09/how-to-repair-corrupted-mysql-tables-using-myisamchk/HowToRepairCorruptedMySQLTablesUsingmyisamchkMyISAMisthedefaultstorageengineforMySQLdatabase.MyISAMtablege
edwzhang
·
2015-12-08 18:00
关于Tree相关问题总结---重点
inorder(non-descendingorderforBST),postordertraversal(deletetree)的recursive方法还有iterative的方法http://www.
geeks
for
geeks
.org
xyqzki
·
2015-12-08 10:00
leetcode -- Rotate Array -- 重点
这里要参考http://bookshadow.com/weblog/2015/02/24/leetcode-rotate-array/http://www.
geeks
for
geeks
.org/array-rotation
xyqzki
·
2015-12-04 15:00
LeetCode
Java抽象类与接口的区别
原文地址:http://www.importnew.com/12399.htmlJava抽象类与接口的区别本文由 ImportNew - jessenpan 翻译自 javacode
geeks
。
j236027367
·
2015-11-30 11:00
java
抽象类
接口
calculate pow(x,n)
Writeaprogramtocalculatepow(x,n)http://www.
geeks
for
geeks
.org/write-a-c-program-to-calculate-powxn/
xyqzki
·
2015-11-27 20:00
LeetCode
CURL常用命令
原文地址: http://www.the
geeks
tuff.com/2012/04/curl-examples/下载单个文件,默认将输出打印到标准输出中(STDOUT)中curl http://www.centos.org
szxy1234
·
2015-11-24 16:37
文件下载
命名
定向
CURL常用命令
原文地址: http://www.the
geeks
tuff.com/2012/04/curl-examples/下载单个文件,默认将输出打印到标准输出中(STDOUT)中curl http://www.centos.org
szxy1234
·
2015-11-24 16:37
文件下载
命名
定向
[LeetCode] Range Sum Query - Mutable
Thisproblemrequiresanewdatastructure---SegmentTree.Youmayusethis
Geeks
for
Geeks
articletogetsomeideasofit.However
jcliBlogger
·
2015-11-23 17:00
Java泛型
译文出处: 外刊IT评论 原文出处:javacode
geeks
泛型是JavaSE5.0中引入的一项特征,自从这项语言特征出现多年来,我相信,几乎所有的Java程序员不仅听说过,而且使用过它。
u010121444
·
2015-11-16 13:00
Team Foundation Server – How Does Microsoft Use It? (Reference From Teams WIT Tools)
reference url: http://
geeks
withblogs.net/sdorman/archive/2008/08/30/team-foundation-server-ndash-how-does-microsoft-uses-it.aspx
·
2015-11-13 21:36
Microsoft
Geeks
for
Geeks
- Adjacency List邻接矩阵C\C++代码
參考站点: http://www.
geeks
for
geeks
.org/graph-and-its-representations/ 这里写了个类,添加删除图的操作。
·
2015-11-13 17:22
list
Android L新控件RecyclerView简介
这篇文章只是另外一篇博客的总结性翻译,能够读懂原文的,可以点开这个链接去阅读精彩的原文:http://www.javacode
geeks
.com/2014/07/android-recyclerview.html
·
2015-11-13 16:42
android
Zoj 3635 <树状数组+二分>
题意: 给出n表示
geeks
人数..也是位置总数.. 给出a1 a2 .. ai .. an 表示第 i 个人想要坐从左往右第 ai 个空位.. 给出m表示询问的个数..
·
2015-11-13 15:20
树状数组
Data Structure Binary Tree: Convert a given tree to its Sum Tree
http://www.
geeks
for
geeks
.org/convert-a-given-tree-to-sum-tree/ 1 #include <iostream> 2 #include
·
2015-11-13 11:16
convert
Data Structure Binary Tree: Populate Inorder Successor for all nodes
http://www.
geeks
for
geeks
.org/populate-inorder-successor-for-all-nodes/ 1 #include <iostream>
·
2015-11-13 11:15
binary
Data Structure Binary Tree: Connect nodes at same level using constant extra space
http://www.
geeks
for
geeks
.org/connect-nodes-at-same-level-with-o1-extra-space/ recursive: 1 #include
·
2015-11-13 11:14
connect
Data Structure Binary Tree: Check if a given Binary Tree is SumTree
http://www.
geeks
for
geeks
.org/check-if-a-given-binary-tree-is-sumtree/ 1 #include <iostream>
·
2015-11-13 11:14
binary
Data Structure Binary Tree: Construct Tree from given Inorder and Preorder traversals
http://www.
geeks
for
geeks
.org/construct-tree-from-given-inorder-and-preorder-traversal/ 1 #include
·
2015-11-13 11:13
binary
Data Structure Binary Tree: Inorder Tree Traversal without recursion and without stack!
http://www.
geeks
for
geeks
.org/inorder-tree-traversal-without-recursion-and-without-stack/ 1 #include
·
2015-11-13 11:12
binary
Data Structure Binary Tree: Inorder Tree Traversal without Recursion
http://www.
geeks
for
geeks
.org/inorder-tree-traversal-without-recursion/ 1 #include <iostream>
·
2015-11-13 11:11
binary
Data Structure Binary Tree: How to determine if a binary tree is height-balanced?
http://www.
geeks
for
geeks
.org/how-to-determine-if-a-binary-tree-is-balanced/ 1 #include <iostream
·
2015-11-13 11:11
height
Data Structure Binary Tree: Diameter of a Binary Tree
http://www.
geeks
for
geeks
.org/diameter-of-a-binary-tree/ 1 #include <iostream> 2 #include &
·
2015-11-13 11:10
binary
Data Structure Binary Tree: Convert an arbitrary Binary Tree to a tree that holds Children Sum Property
http://www.
geeks
for
geeks
.org/convert-an-arbitrary-binary-tree-to-a-tree-that-holds-children-sum-property
·
2015-11-13 11:09
property
Data Structure Binary Tree: Level order traversal in spiral form
http://www.
geeks
for
geeks
.org/level-order-traversal-in-spiral-form/ 1 #include <iostream> 2
·
2015-11-13 11:08
binary
Data Structure Binary Tree: Check for Children Sum Property in a Binary Tree
http://www.
geeks
for
geeks
.org/check-for-children-sum-property-in-a-binary-tree/ 1 #include <iostream
·
2015-11-13 11:07
property
Data Structure Stack: Reverse a stack using recursion
http://www.
geeks
for
geeks
.org/reverse-a-stack-using-recursion/ 1 #include <iostream> 2 #include
·
2015-11-13 10:02
struct
Data Structure Stack: Infix to Postfix
http://
geeks
quiz.com/stack-set-2-infix-to-postfix/ 1 #include <iostream> 2 #include <vector
·
2015-11-13 10:01
postfix
Data Structure Linked List: Flattening a Linked List
http://www.
geeks
for
geeks
.org/flattening-a-linked-list/ 1 #include <iostream> 2 #include <
·
2015-11-13 10:01
struct
Data Structure Linked List: Merge Sort for Linked Lists
http://www.
geeks
for
geeks
.org/merge-sort-for-linked-list/ 1 #include <iostream> 2 #include
·
2015-11-13 10:00
struct
Data Structure Linked List: Detect and Remove Loop in a Linked List
http://www.
geeks
for
geeks
.org/detect-and-remove-loop-in-a-linked-list/ 1 #include <iostream>
·
2015-11-13 10:59
remove
Data Structure Linked List: Reverse a Linked List in groups of given size
http://www.
geeks
for
geeks
.org/reverse-a-list-in-groups-of-given-size/ 1 #include <iostream>
·
2015-11-13 10:58
struct
Data Structure Linked List: Write a function to get the intersection point of two Linked Lists.
http://www.
geeks
for
geeks
.org/write-a-function-to-get-the-intersection-point-of-two-linked-lists/ 第一第二个方法比较简单
·
2015-11-13 10:58
intersect
Data Structure Linked List: Function to check if a singly linked list is palindrome
http://www.
geeks
for
geeks
.org/function-to-check-if-a-singly-linked-list-is-palindrome/ 这里的reverse可以reverse
·
2015-11-13 10:57
function
Data Structure Linked List: Write a function to reverse a linked list
iterative太简单不写了 http://www.
geeks
for
geeks
.org/write-a-function-to-reverse-the-nodes-of-a-linked-list/
·
2015-11-13 10:56
function
Data Structure Array: Move all zeroes to end of array
http://www.
geeks
for
geeks
.org/move-zeroes-end-array/ 1 #include <iostream> 2 #include <vector
·
2015-11-13 10:56
struct
Data Structure Array: Find if there is a subarray with 0 sum
http://www.
geeks
for
geeks
.org/find-if-there-is-a-subarray-with-0-sum/ 1 #include <iostream>
·
2015-11-13 10:55
struct
Data Structure Array: Given an array of of size n and a number k, find all elements that appear more than n/k times
http://www.
geeks
for
geeks
.org/given-an-array-of-of-size-n-finds-all-the-elements-that-appear-more-than-nk-times
·
2015-11-13 10:54
element
Data Structure Array: Maximum circular subarray sum
http://www.
geeks
for
geeks
.org/maximum-contiguous-circular-sum/ 1 #include <iostream> 2 #include
·
2015-11-13 10:53
struct
Data Structure Array: Sort elements by frequency
http://www.
geeks
for
geeks
.org/sort-elements-by-frequency-set-2/ 1 #include <iostream> 2 #include
·
2015-11-13 10:53
element
Data Structure Array: Largest subarray with equal number of 0s and 1s
http://www.
geeks
for
geeks
.org/largest-subarray-with-equal-number-of-0s-and-1s/ 1 #include <iostream
·
2015-11-13 10:52
number
Data Structure Array: Find the two numbers with odd occurrences in an unsorted array
http://www.
geeks
for
geeks
.org/find-the-two-numbers-with-odd-occurences-in-an-unsorted-array/ 1 #include
·
2015-11-13 10:51
number
Data Structure Array: Longest Monotonically Increasing Subsequence Size
http://www.
geeks
for
geeks
.org/longest-monotonically-increasing-subsequence-size-n-log-n/ 1 #include
·
2015-11-13 10:50
sequence
Data Structure Array: Maximum of all subarrays of size k
http://www.
geeks
for
geeks
.org/maximum-of-all-subarrays-of-size-k/ 1 #include <iostream> 2 #
·
2015-11-13 10:50
Arrays
Data Structure Array: Find the minimum distance between two numbers
http://www.
geeks
for
geeks
.org/find-the-minimum-distance-between-two-numbers/ 1 #include <iostream
·
2015-11-13 10:49
number
Data Structure Array: Given an array arr[], find the maximum j – i such that arr[j] > arr[i]
http://www.
geeks
for
geeks
.org/given-an-array-arr-find-the-maximum-j-i-such-that-arrj-arri/ 1 #include
·
2015-11-13 10:48
struct
上一页
9
10
11
12
13
14
15
16
下一页
按字母分类:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他