算法中常见问题总结

十、算法部分

1、说明生活中遇到的二叉树,用java实现二叉树
这是组合设计模式。
我有很多个(假设10万个)数据要保存起来,以后还需要从保存的这些数据中检索是否存在某个数据,(我想说出二叉树的好处,该怎么说呢?那就是说别人的缺点),假如存在数组中,那么,碰巧要找的数字位于99999那个地方,那查找的速度将很慢,因为要从第1个依次往后取,取出来后进行比较。平衡二叉树(构建平衡二叉树需要先排序,我们这里就不作考虑了)可以很好地解决这个问题,但二叉树的遍历(前序,中序,后序)效率要比数组低很多,原理如下图:

代码如下:
package com.huawei.interview;
public class Node {
       public int value;
       public Node left;
       public Node right;
       
       public void store(int value)
       {
              if(value<this.value)
              {
                     if(left == null)
                     {
                            left = new Node();
                            left.value=value;
                     }
                     else
                     {
                            left.store(value);
                     }
              }
              else if(value>this.value)
              {
                     if(right == null)
                     {
                            right = new Node();
                            right.value=value;
                     }
                     else
                     {
                            right.store(value);
                     }                   
              }
       }
       
       public boolean find(int value)
       {     
              System.out.println("happen " + this.value);
              if(value == this.value)
              {
                     return true;
              }
              else if(value>this.value)
              {
                     if(right == null) return false;
                     return right.find(value);
              }else
              {
                     if(left == null) return false;
                     return left.find(value);
              }
       }
       
       public  void preList()
       {
              System.out.print(this.value + ",");
              if(left!=null) left.preList();
              if(right!=null) right.preList();
       }
       
       public void middleList()
       {
              if(left!=null) left.preList();
              System.out.print(this.value + ",");
              if(right!=null) right.preList();        
       }
       public void afterList()
       {
              if(left!=null) left.preList();
              if(right!=null) right.preList();
              System.out.print(this.value + ",");        
       }     
       public static void main(String [] args)
       {
              int [] data = new int[20];
              for(int i=0;i<data.length;i++)
              {
                     data[i] = (int)(Math.random()*100) + 1;
                     System.out.print(data[i] + ",");
              }
              System.out.println();
              
              Node root = new Node();
              root.value = data[0];
              for(int i=1;i<data.length;i++)
              {
                     root.store(data[i]);
              }
              
              root.find(data[19]);
              
              root.preList();
              System.out.println();
              root.middleList();
              System.out.println();             
              root.afterList();
       }
}
-----------------又一次临场写的代码---------------------------
import java.util.Arrays;
import java.util.Iterator;
public class Node {
       private Node left;
       private Node right;
       private int value;
       //private int num;
       
       public Node(int value){
              this.value = value;
       }
       public void add(int value){
              
              if(value > this.value)
              {
                     if(right != null)
                            right.add(value);
                     else
                     {
                            Node node = new Node(value);                          
                            right = node;
                     }
              }
              else{
                     if(left != null)
                            left.add(value);
                     else
                     {
                            Node node = new Node(value);                          
                            left = node;
                     }                   
              }
       }
       
       public boolean find(int value){
              if(value == this.value) return true;
              else if(value > this.value){
                     if(right == null) return false;
                     else return right.find(value);
              }else{
                     if(left == null) return false;
                     else return left.find(value);                   
              }
       }
       
       public void display(){
              System.out.println(value);
              if(left != null) left.display();
              if(right != null) right.display();
              
       }
       
       /*public Iterator iterator(){
              
       }*/
       
       public static void main(String[] args){
              int[] values = new int[8];
              for(int i=0;i<8;i++){
                     int num = (int)(Math.random() * 15);
                     //System.out.println(num);
                     //if(Arrays.binarySearch(values, num)<0)
                     if(!contains(values,num))
                            values[i] = num;
                     else
                            i--;
              }
              
              System.out.println(Arrays.toString(values));
              
              Node root  = new Node(values[0]);
              for(int i=1;i<values.length;i++){
                     root.add(values[i]);
              }
              
              System.out.println(root.find(13));
              
              root.display();
              
       }
       
       public static boolean contains(int [] arr, int value){
              int i = 0;
              for(;i<arr.length;i++){
                     if(arr[i] == value) return true;
                     
              }
              return false;
       }

2、第1个人10,第2个比第1个人大2岁,依次递推,请用递归方式计算出第8个人多大?

package cn.itcast;
import java.util.Date;
public class A1 {
    public static void main(String [] args)
    {
        System.out.println(computeAge(8));
    }
    
    public static int computeAge(int n)
    {
        if(n==1) return 10;
        return computeAge(n-1) + 2;
    }
}
    public static void toBinary(int n,StringBuffer result)
    {
        if(n/2 != 0)
            toBinary(n/2,result);
        result.append(n%2);     
    }

3、排序都有哪几种方法?请列举。用JAVA实现一个快速排序。

public class QuickSort {
/**
* 快速排序
* @param strDate
* @param left
* @param right
*/
public void quickSort(String[] strDate,int left,int right){
String middle,tempDate;
int i,j;
i=left;
j=right;
middle=strDate[(i+j)/2];
do{
while(strDate[i].compareTo(middle)<0&& i<right)
i++; //找出左边比中间值大的数
while(strDate[j].compareTo(middle)>0&& j>left)
j--; //找出右边比中间值小的数
if(i<=j){ //将左边大的数和右边小的数进行替换
tempDate=strDate[i];
strDate[i]=strDate[j];
strDate[j]=tempDate;
i++;
j--;
}
}while(i<=j); //当两者交错时停止
if(i<right){
quickSort(strDate,i,right);//从
}
if(j>left){
quickSort(strDate,left,j);
}
}
/**
  * @param args
  */
public static void main(String[] args){
String[] strVoid=new String[]{"11","66","22","0","55","22","0","32"};
QuickSort sort=new QuickSort();
sort.quickSort(strVoid,0,strVoid.length-1);
for(int i=0;i<strVoid.length;i++){
System.out.println(strVoid[i]+" ");
}
}
}

4、金额转换,阿拉伯数字的金额转换成中国传统的形式如:(¥1011)->(一千零一拾一元整)输出。

去零的代码:
    return sb.reverse().toString().replaceAll("零[拾佰仟]","零").replaceAll("零+万","万").replaceAll("零+元","元").replaceAll("零+","零");
public class RenMingBi {
    /**
     * @param args add by zxx ,Nov 29, 2008
     */
    private static final char[] data = new char[]{
            '零','壹','贰','叁','肆','伍','陆','柒','捌','玖'
        };
    private static final char[] units = new char[]{
        '元','拾','佰','仟','万','拾','佰','仟','亿'
    };
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        System.out.println(
                convert(135689123));
    }
    public static String convert(int money)
    {
        StringBuffer sbf = new StringBuffer();
        int unit = 0;
        while(money!=0)
        {
            sbf.insert(0,units[unit++]);
            int number = money%10;
            sbf.insert(0, data[number]);
            money /= 10;
        }
        return sbf.toString();
    }
}

5、从类似如下的文本文件中读取出所有的姓名,并打印出重复的姓名和重复的次数,并按重复次数排序:

1,张三,28
2,李四,35
3,张三,28
4,王五,35
5,张三,28
6,李四,35
7,赵六,28
8,田七,35
程序代码如下(答题要博得用人单位的喜欢,包名用该公司,面试前就提前查好该公司的网址,如果查不到,现场问也是可以的。还要加上实现思路的注释):
package com.huawei.interview;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.TreeSet;
public class GetNameTest {
       /**
        * @param args
        */
       public static void main(String[] args) {
              // TODO Auto-generated method stub
              //InputStream ips = GetNameTest.class.getResourceAsStream("/com/huawei/interview/info.txt");
              //用上一行注释的代码和下一行的代码都可以,因为info.txt与GetNameTest类在同一包下面,所以,可以用下面的相对路径形式
              
              Map results = new HashMap();
              InputStream ips = GetNameTest.class.getResourceAsStream("info.txt");
              BufferedReader in = new BufferedReader(new InputStreamReader(ips));
              String line = null;
              try {
                     while((line=in.readLine())!=null)
                     {
                            dealLine(line,results);
                     }
                     sortResults(results);
              } catch (IOException e) {
                     // TODO Auto-generated catch block
                     e.printStackTrace();
              }
       }
       
       static class User
       {
              public  String name;
              public Integer value;
              public User(String name,Integer value)
              {
                     this.name = name;
                     this.value = value;
              }
              @Override
              public boolean equals(Object obj) {
                     // TODO Auto-generated method stub
                            
                     //下面的代码没有执行,说明往treeset中增加数据时,不会使用到equals方法。
                     boolean result = super.equals(obj);
                     System.out.println(result);
                     return result;
              }
       }
       
       private static void sortResults(Map results) {
              // TODO Auto-generated method stub
              TreeSet sortedResults = new TreeSet(
                            new Comparator(){
                                   public int compare(Object o1, Object o2) {
                                          // TODO Auto-generated method stub
                                          User user1 = (User)o1;
                                          User user2 = (User)o2;
                                          /*如果compareTo返回结果0,则认为两个对象相等,新的对象不会增加到集合中去
                                           * 所以,不能直接用下面的代码,否则,那些个数相同的其他姓名就打印不出来。
                                           * */
                                          
                                          //return user1.value-user2.value;
                                          //return user1.value<user2.value?-1:user1.value==user2.value?0:1;
                                          if(user1.value<user2.value)
                                          {
                                                 return -1;
                                          }else if(user1.value>user2.value)
                                          {
                                                 return 1;
                                          }else
                                          {
                                                 return user1.name.compareTo(user2.name);
                                          }
                                   }
                                   
                            }
              );
              Iterator iterator = results.keySet().iterator();
              while(iterator.hasNext())
              {
                     String name = (String)iterator.next();
                     Integer value = (Integer)results.get(name);
                     if(value > 1)
                     {                          
                            sortedResults.add(new User(name,value));                        
                     }
              }
              
              printResults(sortedResults);
       }
       private static void printResults(TreeSet sortedResults)
       {
              Iterator iterator  = sortedResults.iterator();
              while(iterator.hasNext())
              {
                     User user = (User)iterator.next();
                     System.out.println(user.name + ":" + user.value);
              }     
       }
       public static void dealLine(String line,Map map)
       {
              if(!"".equals(line.trim()))
              {
                     String [] results = line.split(",");
                     if(results.length == 3)
                     {
                            String name = results[1];
                            Integer value = (Integer)map.get(name);
                            if(value == null) value = 0;
                            map.put(name,value + 1);
                     }
              }
       }
}

6、写一个Singleton出来。

第一种:饱汉模式
public class SingleTon {
       private SingleTon(){
              }
       //实例化放在静态代码块里可提高程序的执行效率,但也可能更占用空间       
       private final static SingleTon instance = new SingleTon();
       public static SingleTon getInstance(){
              return instance;
       }
}
第二种:饥汉模式
public class SingleTon {
       private SingleTon(){}
       
       private static instance = null;//new SingleTon();
       
       public static synchronized SingleTon getInstance(){
              if(instance == null)
                     instance = new SingleTon();
              return instance;
       }
}
第三种:用枚举
    public enum SingleTon{
        ONE;
    
    }
第三:更实际的应用(在什么情况用单例)
public class SequenceGenerator{
    //下面是该类自身的业务功能代码
       private int count = 0;
       public synchronized int getSequence(){
              ++count;
       }
       
    //下面是把该类变成单例的代码
       private SequenceGenerator(){}
       private final static instance = new SequenceGenerator();
       public static SingleTon getInstance(){
              return instance;
       }     
       
}
第四:
       public class MemoryDao
       {
    private HashMap map = new HashMap();
   
       public void add(Student stu1){
           map.put(SequenceGenerator.getInstance().getSequence(),stu1);
    }
  
   //把MemoryDao变成单例
  }
Singleton模式主要作用是保证在Java应用程序中,一个类Class只有一个实例存在。
一般Singleton模式通常有几种种形式:
第一种形式: 定义一个类,它的构造函数为private的,它有一个static的private的该类变量,在类初始化时实例话,通过一个public的getInstance方法获取对它的引用,继而调用其中的方法。
public class Singleton {
private Singleton(){}
      //在自己内部定义自己一个实例,是不是很奇怪?
      //注意这是private 只供内部调用
      private static Singleton instance = new Singleton();
      //这里提供了一个供外部访问本class的静态方法,可以直接访问  
      public static Singleton getInstance() {
        return instance;   
      }
   }
   第二种形式:
public class Singleton {
  private static Singleton instance = null;
  public static synchronized Singleton getInstance() {
  //这个方法比上面有所改进,不用每次都进行生成对象,只是第一次     
  //使用时生成实例,提高了效率!
  if (instance==null)
    instance=new Singleton();
            return instance;   
    }
}
其他形式:
定义一个类,它的构造函数为private的,所有方法为static的。
一般认为第一种形式要更加安全些

7、古典问题:有一对兔子,从出生后第3个月起每个月都生一对兔子,小兔子长到第三个月后每个月又生一对兔子,假如兔子都不死,问每个月的兔子总数为多少?   

这是一个菲波拉契数列问题
public class lianxi01 {
public static void main(String[] args) {
System.out.println("
第1个月的兔子对数:    1");
System.out.println("
第2个月的兔子对数:    1");
int f1 = 1, f2 = 1, f, M=24;
     for(int i=3; i<=M; i++) {
      f = f2;
      f2 = f1 + f2;
      f1 = f;
      System.out.println("
第" + i +"个月的兔子对数: "+f2);
         }
}
}

8、简单的说个递归

N阶乘:
public int factorial(int m)
     {
               if (m < 0)
                     return 0;
               else if ( m == 1)
                     reteurn 1;
                else if (m > 1)
                    return m * factorial(m-1);
     }

9、什么是平衡二叉树

平衡二叉树是一棵空树或它的左右两个子树的高度差的绝对值不超过1,并且左右两个子树都是一棵平衡二叉树。

10、怎么判断二叉树是否有环

在遍历二叉树时,能循环到起点指针称为有环。
 2

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值