viclao的专栏

import java.util.Iterator;import java.util.Scanner;import java.util.Vector;/** * 二叉树中和为某一值的路径 * @author Administrator * */public class FindPath { static void findPath(BinaryTree root,int exp

eclipse导出scala工程

import java.util.Stack;/** * 判断出栈序列是否可能 * * @author VIC * */public class IsPopSeq { /** * * @param pPush 给定的入栈序列 * @param pPop 需要判断是否可能的出栈序列 * @return */ public static boolean i

package com.vic.tree;/** * 二叉搜索树的后序遍历 * @author Administrator * */public class SequenceOfBST{ static boolean verifySquenceOfBST(int[] sequence,int start,int end){ if(null==sequence||(end-star

package com.vic.tree;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;/** * 层次遍历二叉树 * @author Administrator * */public class BFSTree { static void BFS(BinaryTree

/*金山2015校招笔试题（java）程序设计第一题*/

import java.util.HashMap;import java.util.Iterator;import java.util.Map;public class HashMapTest {   private static Map map=new HashMap();       /**  1.HashMap 类映射不保证顺序；某

问题描述　　给定n个十六进制正整数，输出它们对应的八进制数。

import java.util.Scanner;public class Main { static void convert(int n,int r) { int[] a = new int[8]; int i = 0; for(; i < 8 && n != 0; i++) { a[i] = n % r; n = n / r; } i--;

package com.vic.string;public class Permutation { private static int count = 0; static void permutation(char[] s,int start){ if(start==s.length){ System.out.println(new String(s).toString());

package com.vic.string;import java.util.ArrayList;import java.util.List;public class Combination { private static int count = 0; static void combination(char[] s){ for(int i=1;i<=s.length;i++

com +- example +- myapplication +- Application.java | +- customer | +- Customer.java | +- CustomerController.java | +- CustomerService...