- 浏览: 429217 次
- 性别:
- 来自: 成都
文章分类
最新评论
-
sunwang810812:
万分感谢中!!!!!这么多年终于看到一个可运行可解决的方案!! ...
POI 后台生成Excel,在前台显示进度 -
zzb7728317:
LZ正解
Spring Jackson AjaxFileUpload 没有执行回调函数的解决办法 -
sleeper_qp:
lz是在源码上修改的么? 源码的话你重新编译一遍了么? 可 ...
由nutch readseg -dump 中文编码乱码想到的…… -
shenjian430:
请问你改好的程序在写在哪了?
由nutch readseg -dump 中文编码乱码想到的…… -
yinxusen:
It seems to be the bug occur in ...
Mahout Local模式 执行example的注意点
1、用数组实现Stack:
2、用数组实现Queue:
3、递归实现BinaryTree:
public class MyStack { private int maxSize; private Integer[] array; private int top; public MyStack(int maxSize) { this.maxSize = maxSize; this.array = new Integer[maxSize]; this.top = -1; } public void push(int item) { if (isFull()) { System.out.println("Stack is full"); } else { array[++top] = item; } } public Integer peek() { if (isEmpty()) { System.out.println("Stack is empty"); return null; } else { return array[top]; } } public Integer pop() { if (isEmpty()) { System.out.println("Stack is empty"); return null; } else { return array[top--]; } } public boolean isEmpty() { return top == -1; } public boolean isFull() { return top == maxSize - 1; } public static void main(String[] args) { MyStack myStack = new MyStack(10); myStack.push(1); myStack.push(3); System.out.println("peek: " + myStack.peek()); myStack.push(5); System.out.println("pop: " + myStack.pop()); System.out.println("peek: " + myStack.peek()); myStack.push(6); System.out.println("peek: " + myStack.peek()); System.out.println("pop: " + myStack.pop()); System.out.println("pop: " + myStack.pop()); System.out.println("pop: " + myStack.pop()); System.out.println("pop: " + myStack.pop()); } }
2、用数组实现Queue:
public class MyQueue { private int maxSize; private Integer[] array; private int front; private int rear; private int itemCount; public MyQueue(int maxSize) { this.maxSize = maxSize; this.array = new Integer[maxSize]; this.front = 0; this.rear = -1; this.itemCount = 0; } public void insert(int item) { if (isFull()) { System.out.println("Queue is full"); } else { if (rear == maxSize - 1) { rear = -1; } array[++rear] = item; itemCount++; } } public Integer remove() { if (isEmpty()) { System.out.println("Queue is empty"); return null; } else { int temp = array[front++]; if (front == maxSize) { front = 0; } itemCount--; return temp; } } public Integer peek() { if (isEmpty()) { System.out.println("Queue is empty"); return null; } else { return array[front]; } } public boolean isEmpty() { return itemCount == 0; } public boolean isFull() { return itemCount == maxSize; } public static void main(String[] args) { MyQueue myQueue = new MyQueue(5); myQueue.insert(1); myQueue.insert(2); myQueue.insert(3); myQueue.insert(4); myQueue.insert(5); myQueue.insert(6); System.out.println("peek: " + myQueue.peek()); myQueue.insert(5); System.out.println("remove: " + myQueue.remove()); System.out.println("peek: " + myQueue.peek()); myQueue.insert(6); System.out.println("peek: " + myQueue.peek()); System.out.println("remove: " + myQueue.remove()); System.out.println("remove: " + myQueue.remove()); System.out.println("peek: " + myQueue.peek()); System.out.println("remove: " + myQueue.remove()); System.out.println("remove: " + myQueue.remove()); } }
3、递归实现BinaryTree:
public class MyBinaryTree { private static class Node { int data; Node left; Node right; public Node(int data) { this.data = data; this.left = null; this.right = null; } } public Node root; public MyBinaryTree() { root = null; } private Node insert(Node node, int data) { if (node == null) { node = new Node(data); } else { if (data <= node.data) { node.left = insert(node.left, data); } else { node.right = insert(node.right, data); } } return node; } public void insert(int data) { root = insert(root, data); } public void insert(int[] data) { for (int i : data) { insert(i); } } public void preOrder(Node node) { if (node == null) { return; } System.out.println(node.data); preOrder(node.left); preOrder(node.right); } public void inOrder(Node node) { if (node == null) { return; } preOrder(node.left); System.out.println(node.data); preOrder(node.right); } public void postOrder(Node node) { if (node == null) { return; } preOrder(node.left); preOrder(node.right); System.out.println(node.data); } public static void main(String[] args) { MyBinaryTree binaryTree = new MyBinaryTree(); int[] data = { 4, 8, 7, 2, 9, 3, 1, 6, 5 }; binaryTree.insert(data); System.out.println("preOrder:"); binaryTree.preOrder(binaryTree.root); System.out.println("inOrder:"); binaryTree.inOrder(binaryTree.root); System.out.println("postOrder:"); binaryTree.postOrder(binaryTree.root); } }
发表评论
-
hibernate的Criteria Query(转)
2014-06-29 21:22 676当查询数据时,人们往往需要设置查询条件。在SQL或HQL语句 ... -
【转】hibernate 中 Criteria 的使用介绍
2014-06-29 21:21 927转自:http://www.blogjava.net/jjs ... -
【转】Hibernate中Criteria的完整用法
2014-06-29 21:20 684转自:http://www.cnblogs.com/maba ... -
Java读写Oracle中的BLOB和CLOB
2013-10-16 18:00 1961转:http://www.iteye.com/topic/6 ... -
Spring的事务管理入门:编程式事务管理(TransactionTemplate)
2013-10-15 16:20 978可有效应用于Oracle 临时表的insert和select ... -
jdbcTemplate 调用存储过程和回到函数
2013-10-15 09:09 3715转:http://blog.csdn.net/dancelo ... -
Spring3核心技术之JdbcTemplate
2013-10-15 09:03 1263转:http://zhou137520.iteye.com/ ... -
验证码在WebLogic下报错java.io.IOException: response already committed
2013-05-06 14:16 2523我的登录验证码代码,一个jsp,在Tomcat下没有问题,但 ... -
Struts2在eclipse的console中总是出现WARN OgnlValueStack:45 - Could not find property
2013-04-17 18:00 1673struts2 在发开时,控制台如输出大量警告信息,太烦人 ... -
【转】Eclipse自动关闭解决方法及eclipse.ini设置
2013-03-29 15:21 3777转自:http://liujun5563.blog.163. ... -
[转]批量将Java源代码文件的编码从GBK转为UTF-8
2012-11-12 13:43 1464转自:http://my.oschina.net/binny/ ... -
对代理模式与Java动态代理类的理解
2012-09-25 01:51 01. 代理模式 代理模式的作用是:为其他对象提供一种 ... -
【转】 java中yield(),sleep()以及wait()的区别
2012-09-13 22:49 808从操作系统的角度讲,os会维护一个ready queue(就绪 ... -
java 继承类 变量、静态变量、构造函数执行顺序
2012-09-10 16:07 1003包含普通变量、静态变量、构造函数、继承类的执行顺序为: 1、父 ... -
京东2012春笔试编程题
2012-09-10 12:58 01、求给定数组中最大的K个数function array[] ... -
Java中a++和++a的分析
2012-09-18 08:34 2828本人从编译后的代码来看a++和++a的区别: 先看代码1: ... -
华为2012校园上机编程题
2012-09-09 16:04 0/** * 1. 手机号码合法 ... -
2011年9月7日,华为上机题Java实现
2012-09-08 15:58 0第二题: /** * 输入字符串长度len,字符串str, ... -
Java对于Cookie的操作详解
2012-09-18 08:34 7861.设置Cookie Cookie cookie = n ... -
自定义约瑟夫环
2012-09-11 10:29 682约瑟夫环(Josephus)问题:古代某法官要判决n个犯人的死 ...
相关推荐
二叉树(BinaryTree)、二叉搜索树(BinarySearchTree、BST) 平衡二叉搜索树(BalancedBinarySearchTree、BBST) AVL树(AVLTree)、红黑树(RebBlackTree) B树(B-Tree) 集合(TreeSet)、映射(TreeMap) ...
Construct Binary Tree from Inorder and Postorder Traversal 二叉查找树 Unique Binary Search Trees Unique Binary Search Trees II Validate Binary Search Tree Convert Sorted Array to Binary Search Tree ...
Binary search tree Dynamic order statistics Red-black tree Interval tree Prefix Tree(Trie) *Suffix Tree(未实现)* B-Tree Hash by multiplication Hash table Universal hash function Perfect hash Java's ...
insertion sort, shell sort, quick sort, merge sort, heap sort), searching algorithms (Binary search tree, Red-Black BST, hashing), 所以程序都用java实现,代码风格简洁,很值得学习。
java lru leetcode Algorithms 为什什么要学习算法与数据结构 编程的内功修炼 去国内一流互联网公司的必要条件 硅谷互联网公司面试更是要求当场写算法题目 算法和数据结构是有趣且实用的 Data Structure Array Stack...
Self-balancing binary search tree 180 Tree rotation 182 Weight-balanced tree 185 Threaded binary tree 186 AVL tree 191 Red-black tree 195 AA tree 210 Scapegoat tree 215 Splay tree 219 T-tree 234 Rope ...
9.用两个栈实现队列 Stack,Queue 关注 9.两个队列实现栈 Stack,Queue 关注 10.斐波那契数列 Dynamic Programming, 10.跳台阶 Dynamic Programming, 10.变态跳台阶 Dynamic Programming,Math 10.矩形覆盖 Dynamic ...
Queue - 使用双链表的队列实现 [] Stack - 自定义 JS 堆栈实现 [] Graph - JS Graph 实现 [] Binary Tree - JS 使用树节点的二叉树实现 [] Binary Search Tree - JS 二叉搜索树(继承)[] Min Heap - JS 最小堆,...
Get a grasp on the basics of abstract data types—stack, queue, and double ended queue See how to use recursive functions and immutability while understanding and in terms of recursion Handle reactive...
java lru leetcode ...Tree/BinaryTree BST HashTable Disjoint Set Trie BloomFilter LRU Cache Algorithm General Coding InOrder/PreOrder/PostOrder Traversal Greedy Recursion/Backtrace Breadth-fi
java arraylist源码数据结构算法 使用Java编程语言的数据结构和算法源代码(包括Stack,LinkedList,ArrayList,Queue和Binary Tree)
Levent Divilioglu-2017年夏季待办事项: 附录将在此自述文件中创建DS_011软件包:BTree实现将完成DS_011软件包:AVLTree的实现将完成DS_012套装:骑士之旅将被展示DS_013套件:图表将完成DS_013封装:实施广度优先...
学数据结构的时候自己写的几种基本数据结构,包括binary tree,circular queueu,linked list,linked queue,linked stack,sequence list,sequence stack
基本的Java数据结构用简单易读的Java实现的各种(基本)数据结构。介面堆栈接口队列接口树木二进制搜索树AVL树最小堆基本/各种数据结构链表哈希表队列(ArrayQueue,ListQueue) 堆栈(ArrayListStack,ListStack)...
leetcode卡 LeetCode 记录一下再LeetCode上刷的题,坚持每天刷一道...Tree/stack 2017.06.20 打卡[LeetCode 107. Binary Tree Level Order Traversal II], Tree/BFS 2017.06.20 打卡[LeetCode 324. Wiggle Sort II], S
This book begins by covering the basics of the JavaScript language and then moves on to discuss the most important data structures such as array, queue, stack, and linked list. You will also gain an ...
java lru leetcode LeetCode 记录数据结构与算法/LeetCode练习过程,将持续更新 Best Time To Buy And Sell Stock [Binary Tree](Basic-Knowledge/Binary tree.md) Serialize And Deserialize Bit 1.position 2....
STACK & QUEUE 13. Stack 14. Expression Parsing 15. Queue SEARCHING TECHNIQUES 16. Linear Search 17. Binary Search 18. Interpolation Search 19. Hash Table SORTING TECHNIQUES 20. Sorting Algorithm 21....
数据结构数据结构-C ++实现C ++模板实现常用数据结构,包括向量,链表,栈,数量,二叉树,二叉搜索树,平衡二叉树,优先权(堆),图,排序...二叉树二叉树节点:BinaryTreeNode.h头文件:BinaryTree.h测试函数:binar
:rocket: JS数据结构 用CodeSandbox创建 数据结构Icerik 链接列表(Bagli ... 3 Binary Tree * Binary Tree * BST * AVL, Red Black vs. vs.4堆 6.Graph * MST * Shortes Path * Max Flow 7.Hash 9,Matrisler