- 博客(30)
- 收藏
- 关注
RSS订阅原创 翻转
Reverse String Given s = “hello”, return “ollehpublic class Solution { public String reverseString(String s) { char[] array = s.toCharArray();//先把STRING转化为char[] int i = 0;//首
2016-06-08 08:33:59
368
转载 Java I/O
Java uses the concept of stream to make I/O operation fast.StreamA stream is a sequence of data.In Java a stream is composed of bytes1) System.out: standard output stream2) System.in: standard input st
2015-11-25 05:56:10
470
转载 RMI
The RMI (Remote Method Invocation) is an API that provides a mechanism to create distributed application in java. The RMI allows an object to invoke methods on an object running in another JVM.The RMI
2015-11-19 09:28:14
400
原创 Python 学习LINK
http://python.xiaoleilu.com/001.html http://www.cnblogs.com/dolphin0520/category/400707.html
2015-11-18 22:59:07
533
转载 Java Collection
Java ArrayList classJava ArrayList class uses a dynamic array for storing the elements. It extends AbstractList class and implements List interface. Java ArrayList class can contain duplicate element
2015-11-17 22:50:06
625
原创 Heap 练习题
Basic find-max or find-min: find the maximum item of a max-heap or a minimum item of a min-heap (a.k.a. peek)insert: adding a new key to the heap (a.k.a., push[1])extract-min [or extract-max]: returns
2015-11-17 09:53:05
616
原创 linkedlist
链表问题包含： 删除节点，插入排序，旋转Remove Linked List Elements# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution:
2015-11-17 01:06:06
333
转载 Heap应用
Data compression: Huffman Coding algorithm Shortest path algorithms: Dijkstra’s algorithm Min spanning tree:prim’s algorithm Even-driven simulation:customer in a line Selection problem: Finding kth
2015-11-16 14:53:16
436
转载 Java网络编程
OSI 参考模型物理层 这一层为上一层提供物理连接，数据作为原始的bit流传输数据链路层 负责两个相邻节点的线路，无差错地传送以针为单位的数据。每一针包括一定的数据和必要的控制信息。典型switch交换机网络层 选择合适的网间路由和交换节点，确保数据及时传输到目标主机。路由器传输层 根据通信子网的特性最佳地利用网络资源，为两个端系统的对话提供建立，维护和取消传输连接的功能会话层 管理进程之
2015-11-15 04:19:24
389
转载 Java Socket Programming
Java Socket programming is used for communication between the applications running on different JRE.Java Socket programming can be connection-oriented or connection-less.Socket and ServerSocket classes
2015-11-14 22:25:32
443
转载 文章标题
Java NetworkingJava Networking is a concept of connecting two or more computing devices together so that we can share resources.Java socket programming provides facility to share data between different
2015-11-14 09:25:39
299
转载 节点操作总结
Stack 添加元素 def push( self, newValue ): self.top = LinkedNode( newValue, self.top )队列添加元素def enqueue( self, newValue ): newNode = LinkedNode( newValue ) if self.front == None:
2015-11-11 11:38:22
420
转载 文章标题
Socket classA socket is simply an endpoint for communications between the machines. The Socket class can be used to create a socket.Important methodsMethod Description 1) public InputStream getInputS
2015-11-10 22:07:29
293
转载 Heap
https://www.youtube.com/watch?v=fJORlbOGm9Yhttps://www.youtube.com/watch?v=LhhRbRXhB40
2015-11-10 20:00:14
330
转载 4.1 Maximum and Minimum Value
Let c be a number in the domain D of a function F. Then Fc is the Absolute maximum value of f on D if Fc>=fx for all x in D Absolute minimum value of f on D if Fc<=fx for all x in DThe number fc is a
2015-11-09 10:21:45
1194
转载 Tree
树节点Inserting an element into a tree Deleting an element from a tree searching for an element Traversing the treefinding the size of the tree finding the height of the tree find levelclass BTNode
2015-11-09 03:54:31
369
转载 The Ordered List Abstract Data Type
The structure of an ordered list is a collection of items where each item holds a relative position that is based upon some underlying characteristic of the item. The ordering is typically either ascen
2015-11-09 01:05:00
500
转载 The Unordered List Abstract Data Type
The structure of an unordered list, as described above, is a collection of items where each item holds a relative position with respect to the others. Some possible unordered list operations are given
2015-11-09 00:14:22
669
转载 Queue
The most recently added item in the queue must wait at the end of the collection. The item that has been in the collection the longest is at the front. This ordering principle is sometimes called FIFO,
2015-11-08 09:48:59
373
转载 Stack
This ordering principle is sometimes called LIFO, last-in first-out. It provides an ordering based on length of time in the collection. Newer items are near the top, while older items are near the base
2015-11-08 09:38:25
339
转载 Linked Data structure
To understand the abstract data types stack, queue, deque, and list.To be able to implement the ADTs stack, queue, and deque using Python lists.To understand the performance of the implementations of b
2015-11-08 09:15:29
430
转载 Sorting methods Summary
A sequential search is O(n) for ordered and unordered lists. A binary search of an ordered list is O(logn) in the worst case. Hash tables can provide constant time searching. A bubble sort, a select
2015-11-08 09:09:03
383
转载 The Quick Sort
A quick sort first selects a value, which is called the pivot value. Although there are many different ways to choose the pivot value, we will simply use the first item in the list. The role of the piv
2015-11-08 09:00:35
706
1
转载 The Merge Sort
Merge sort is a recursive algorithm that continually splits a list in half. If the list is empty or has one item, it is sorted by definition (the base case). If the list has more than one item, we spli
2015-11-08 06:43:37
851
转载 The Selection Sort
A selection sort looks for the largest value as it makes a pass and, after completing the pass, places it in the proper location. As with a bubble sort, after the first pass, the largest item is in t
2015-11-08 05:59:55
772
转载 Sorting
The Bubble SortThe bubble sort makes multiple passes through a list. It compares adjacent items and exchanges those that are out of order. Each pass through the list places the next largest value in it
2015-11-08 04:42:21
523
转载 Search
The Sequential SearchTo be able to explain and implement sequential search and binary search. To be able to explain and implement selection sort, bubble sort, merge sort, quick sort, insertion sort, a
2015-11-08 00:30:00
656
转载 初步学习JAVA网络编程
初步学习JAVA网络编程今天我开始学习JAVA NETWORKING 一下内容为摘抄教程网站。http://www.javatpoint.com/java-networkingJava NetworkingJava Networking is a concept of connecting two or more computing devices together so that we can s
2015-11-07 09:20:40
668
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人