黑马程序员--java学习日志之第一天;JAVA基础

----------- android培训java培训、java学习型技术博客、期待与您交流! ------------

----------------------- android培训java培训、java学习型技术博客、期待与您交流! ----------------------

/* 第一天 JAVA基础

一、常见Dos命令行

       dir  列出当前目录下的文件及文件夹

        md   创建目录

        rd   删除目录

        cd   进入指定目录

        cd.. 退回到上一级目录

        cd/  退回到根目录

        del  删除文件

        exit 退出DOS命令行

二、三种技术架构

  JavaEE Java Platform Enterprise Edition  企业版

  JavaSE Java Platform Standard  Edtion   标准版

  JavaME Java Platform Micro Edtion        小型版

三、JVM JAVA  VIRTUAL MACHINE

        JDK  JAVA DEVELOPMENT KIT

        JRE  JAVA RUNTIME ENVIRONMENT

四、Java 语言基础

        1、关键字

           访问权限修饰符 private public protected

           类、函数、变量修饰符 abstract final static synchronized

           类与类之间关系 extends implements

           定义建立实例及引用实例、判断实例 new  this  super instanceof

           异常处理 tyr  catch  finally throw  throws

            package import

           其他 native strictfp transient volatile assert

        2、标示符 数字 字母 _  $ 

           注:数字不能开头 严格区分大小写

        3、注释

        4、常量变量 整数默认 int 小数默认 double

             基本数据类型 数值型 整数类型 byte  short int  long

                    浮点类型 float  double

                               字符型 char

                               布尔型 boolean

             引用数据类型  class

                                      接口 interface

                                       数组[]

        5、运算符

                         算术运算符

                         赋值运算符

                         比较运算符    instanceof

                         逻辑运算符

                         位运算符

                         三元运算符

        6、语句

                  switch  语句选择的类型只有四种:byte,short,int,char

        7、函数

                  重载 overload同名不同参

        8、数组

           A、内存结构

                    栈内存 存储局部变量,当数据使用完所占空间会自动释放

                    堆内存 数组和对象 new建立的实例都存放在其中

                                 每一个实体都有内存地址值

                                 实体中的变量都有默认初始化值

                                 实体不再被使用,会在不确定的时间内被垃圾回收器回收

                    方法区

                    本地方法区

                    寄存器

           

=====================================================

技巧:

  1.  环境变量清空:set classpath=

  2 classpath 先在变量找,再在当前目录找(q前提是有;)

           path  先在当前目录下找,再在变量中找

  3负数的二进制是其正数的二进制取反加1

  4不用第三方变量 

         n=n^m;m=n^m;n=n^m;

         容易溢出

          n=n+m;m=n-m;n=n-m;

          推荐使用引入第三方变量

  5获取某数的最低四位 某数&15

  6无限循环的最简单表现形式: for(;;)    while(true)

  7标号 只能用于循环上,做标记跳出用

  8冒泡选择排序,希尔排序最快

 

*/

import java.util.*;

class JavaAbc

{

        public static void main(String[] args)

   {

                  //new HelloWorldDemo().show();  //helloWorld 输出

                  //System.out.println('\n');//输出换行符

                  //System.out.println(new SumDemo().getSum());//获取1~10的和

                  // new SangleDemo().pSangle();//输出矩形 上三角形 下三角形

                  //new p9_9().show(9);//打印九九乘法表

                 //new Test().pTest();//打印_*;

                  new ArrayDemo().arrayTest();//数组练习

           

        }

}

//=====================================

/*

数组的操作

*/

class ArrayDemo

{  

         public static void arrayTest()

       {

                   int[] arr={1,3,7,5,28,0,23,6,9,56};

                   printArray(arr);

                   p(getMax(arr));

                   p("\n");

                   p(getMin(arr));

                   p("\n");

                   //p("选择排序");

                  // arraySort1(arr);

                   //p("冒泡排序");

                  // arrayBubbleSort(arr);

                  // p("真实开发");

                  //Arrays.sort(arr);

                  //printArray(arr);

                  int[] arr1={1,3,5,7,9,11};

                  p("折半查找");

                  p(halfSearch(arr1,7));

                  p(halfSearch(arr1,13));

        }

        //折半查找必须是有序数组

        public static int  halfSearch(int[] arr,int key)

        {

                  int min=0,max=arr.length-1,mid=(min+max)/2;

                  while(arr[mid]!=key)

                  {

                           if(arr[mid]>key)

                           {

                                    max=mid-1;

                           }

                           else if (arr[mid]<key)

                           {

                                    min=mid+1;

                           }

                           if(min>max)  return -1;

                           mid=(min+max)/2;

                  }

                  return mid;

        }

         //遍历

         public static void printArray(int[] arr)

         {

                   for(int i=0;i<arr.length;i++)

                           p(arr[i]);

                   p("\n");

        }

        //获取数组最大值

         public static int getMax(int[] arr)

        {

                  int max=arr[0];

                   for(int i=0;i<arr.length;i++)

                  {

                           if(max<arr[i])  max=arr[i];

                  }

                  return max;

   }

        //获取数组最小值

         public static int getMin(int[] arr)

        {

                   int min=arr[0];

                   for(int i=0;i<arr.length;i++)

                  {

                           if(min>arr[i])  min=arr[i];

                  }

                  return min;

   }

        //由小到大排序

        //***冒泡排序

        public static void arrayBubbleSort(int[] arr)

        {

                  int temp=arr[0];

                  for(int i=0;i<arr.length-1;i++)

                  {

                           for(int j=0;j<arr.length-i-1;j++)

                           {

                                    if(arr[i]>arr[i+1])

                                    {

                                              temp=arr[i];

                                              arr[i]=arr[i+1];

                                              arr[i+1]=temp;

                                    }

                           }

                  }

                  printArray(arr);

        }

        //***选择排序

        public static void arraySort1(int[] arr)

        {

                  int temp=arr[0];

                  for(int i=0;i<arr.length;i++)

                  {

                           for(int j=i+1;j<arr.length;j++)

                           {

                                    if(arr[i]>arr[j])

                                    {

                                              temp=arr[i];

                                             arr[i]=arr[j];

                                              arr[j]=temp;

                                    }

                           }

                  }

                  printArray(arr);

        }

         //打印

         public  static void p(Object obj)

        {

                   System.out.print(obj+" ");

        }

}

//=====================================

//输出

/*----*

 ---* *

 --* * *

 -* * * *

*/

class Test

{

        public static void pStar()

   {

                  System.out.print("* ");

        }

        public static void pln()

   {

                  System.out.print("\n");

        }

        public static void p_()

   {

                  System.out.print("-");

        }

        public static void pTest()

        {

                  for(int i=0;i<5;i++)

                  {

                           for(int j=0;j<5-i;j++)

                           {

                                    p_();

                           }

                           for(int j=0;j<=i;j++)

                           {

                                    pStar();

                           }

                           pln();

                  }

        }

}

//=====================================

//九九乘法表

class p9_9

{

        public static void pln()

   {

                  System.out.print("\n");

        }

        public static void show(int i,int j)

        {

                  System.out.print(i+"*"+j+"="+(i*j)+"\t");

        }

        public static void show(int i)

        {

                  for(int x=1;x<=i;x++)

                  {

                           for(int y=1;y<=x;y++)

                           {

                                    show(x,y);

                           }

                           pln();

                  }

 

        }

}

//=================================

//helloWOrld 小程序

class HelloWorldDemo

{

        public static void show()

        {

                  System.out.println("Hello World!");

        }

}

//==================================

//典型例题 类型转换

class OperateDemo 

{

        public static void operateTest()

        {

                  short s=3;

                  //s=s+3;//  编译失败,s+3提升为 int类型,无法赋值给short类型

                  s+=3;//   编译通过 +=  在给s赋值时自动完成强转操作

        }

}

//=====================================

//获取1~10的和并打印

class SumDemo

{

        public static int getSum()

        {

                  int[] ary={1,2,3,4,5,6,7,8,9,10};

                  int sum=0;;

                  for(int s:ary)  //增强for循环

                  {

                           sum+=s;

                  }

                  return sum;

        }

}

//=====================================

/* 打印如下形状

****

****

****

****

 

*****

****

***

**

*

 

*

**

***

****

*****

*/

class SangleDemo

{

        public static void pSangle()

        {

                  juxing();

                  upSangle();

                  downSangle();

        }

 

        public static void pStar()

   {

                  System.out.print("* ");

        }

        public static void pln()

   {

                  System.out.print("\n");

        }

        public static void  juxing()

        {

                  for(int i=0;i<3;i++)

                  {

                           for(int j=0;j<4;j++)

                           {

                                    pStar();

                           }

                           pln();                           

                  }

        }

        public static void upSangle()

        {

                  for(int i=0;i<5;i++)

                  {

                           for(int j=0;j<5-i;j++)

                           {

                                    pStar();

                           }

                           pln();                                    

                  }

 

        }

        public static void downSangle()

        {

                  for(int i=0;i<5;i++)

                  {

                           for(int j=0;j<=i;j++)

                           {

                                    pStar();

                           }

                           pln();

                  }

        }

}

详情请查看:http://edu.csdn.net/heima

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值