Ò׽ؽØÍ¼Èí¼þ¡¢µ¥Îļþ¡¢Ãâ°²×°¡¢´¿ÂÌÉ«¡¢½ö160KB

java£ºÊÖдMyLinkedListËùÓз½·¨£¬Ôöɾ¸Ä²é

package arrays.myArray;
public class MyLinkedList {
 private int size = 0;
 private Node1 head = null;
 // Ìí¼Ó
 public void add(Object obj) {
  add(size, obj);
 }
 // ÐÞ¸Ä
 public void add(int index, Object obj) {
  if (null == head) {
   head = new Node1(obj, null);
  } else {
   if (0 == index) {
    head = new Node1(obj, head);
   } else {
    Node1 temp = head;
    for (int i = 0; i < index - 1; i++) {
     temp = temp.next;
    }
    temp.next = new Node1(obj, temp.next);
   }
  }
  size++;
 }
 // ÒÆ³ý
 public void remove(int index) {
  if (0 == index) {
   head = head.next;
  } else {
   Node1 temp = head;
   for (int i = 0; i < index - 1; i++) {
    temp = temp.next;
   }
   temp.next = temp.next.next;
  }
  size--;
 }
 // ²éѯ
 public Object get(int index) {
  Node1 temp = head;
  for (int i = 0; i < index; i++) {
   temp = temp.next;
  }
  return temp.obj;
 }
 // ×ܳ¤¶È
 public int size() {
  return size;
 }
}
class Node1 {
 Object obj;
 Node1 next;
 public Node1(Object obj, Node1 next) {
  this.obj = obj;
  this.next = next;
 }
}


Ïà¹ØÎĵµ£º

ͨ¹ýJava»òJspÏòÊý¾Ý¿â´æÈ¡¶þ½øÖÆÍ¼Æ¬


¡¡¡¡1 MySQL´æ´¢´óÈÝÁ¿µÄ¶þ½øÖÆÎļþµÄ¸ñʽÊÇblob£¬Æäʵ³ýÁËͼƬ»¹¿ÉÒÔ´æ±ðµÄ
¡¡¡¡2 ÒªÏòÊý¾Ý¿â´æ´¢¶þ½øÖƵÄÎļþÒ»¶¨Òª°ÑÒª´æ´¢µÄÊý¾Ýת»»³É¶þ½øÖÆÁ÷
¡¡¡¡·Ï»°¾Í²»¶à˵ÁË£¬´ó¼Ò¿´¿´´úÂëºÜÈÝÒ×Ã÷°×£¬ÏÈÀ´¿´Ò»¸öapp³ÌÐò£¬µ±È»Ê×ÏÈÄúÒªÔÚÊý¾Ý¿âÖÐÏȽ¨Á¢Ò»¸öÓÃÓÚ±£´æÍ¼Æ¬µÄ±íºÍÏàÓ¦µÄÁУ¬Êý¾Ý¸ñʽΪblob
¡¡¡¡  package ......

Java Ï̱߳à³ÌÖеÄͬ²½¡¢Öظ´¡¢¶¨Ê±

£¨Ò»£©Ïß³Ìͬ²½
ʵÏÖÉú²úÕßÏû·ÑÕßÎÊÌâÀ´ËµÃ÷Ïß³ÌÎÊÌâ,¾ÙÀýÈçÏÂËùʾ:
/**
* Éú²úÕßÏû·ÑÕßÎÊÌâ
*/
public class ProducerConsumer {

/**
* Ö÷·½·¨
*/
public static void main(String[] args) {
ProductBox pb = new ProductBox ......

Java Class Version Ñо¿



Ò»£ºÒª½â¾öµÄÎÊÌâ




ÎÒÃÇÔÚ³¢ÏÊ JDK1.5 µÄʱºò£¬ÏàÐŲ»ÉÙÈËÓöµ½¹ý Unsupported major.minor version 49.0
´íÎ󣬵±Ê±¶¨»áãȻ²»ÖªËù´ë¡£ÒòΪ¸Õ¿ªÊ¼ÄÇ»á¶ù£¬ÍøÉÏÓë´ËÏà¹ØµÄÖÐÎÄ×ÊÁÏ»¹²»¶à£¬ÏÖÔÚºÃÁË£¬ÍøÉÏÒ»ÕÒ¾ÍÖªµÀÊÇÈçºÎ½â¾ö£¬´ó¶à»á¸æËßÄãҪʹÓà JDK
1.4 ÖØÐ±àÒë¡£ÄÇôÖÁÓÚΪʲô£ ......

java£º¶þ·Ö²éÕÒ·¨

package arrays.compara;
/**
 *
 * @author Happy ¶þ·Ö²éÕÒ·¨
 */
public class BinarySearch {
 public static void main(String[] args) {
  int[] arrInt = { 2, 34, 32, 24, 23, 34, 12, 3, 4, 2 };
  int index = bSearch(29, arrInt, 0, arrInt.length);
 & ......

java£ºÊÖд¶þ²æÊ÷BinaryTreeÌí¼ÓºÍ²éѯ·½·¨

package arrays.myArray;
public class BinaryTree {
 private Node root;
 // Ìí¼ÓÊý¾Ý
 public void add(int data) {
  // µÝ¹éµ÷ÓÃ
  if (null == root)
   root = new Node(data, null, null);
  else
   addTree(root, data);
......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ