数组使用
| package com.zhou.array; |
| |
| public class ArrayDemo03 { |
| public static void main(String[] args) { |
| int[] arrays = {1,2,3,4,5}; |
| |
| |
| for (int i=0;i<arrays.length;i++){ |
| System.out.println(arrays[i]); |
| } |
| System.out.println("==============="); |
| |
| int sum = 0; |
| for (int i=0;i<arrays.length;i++){ |
| sum = sum+arrays[i]; |
| } |
| System.out.println("sum"+sum); |
| System.out.println("==============="); |
| |
| |
| int max = arrays[0]; |
| for (int i=0;i<arrays.length;i++){ |
| if (arrays[i]>max){ |
| max = arrays[i]; |
| } |
| } |
| System.out.println("max"+max); |
| } |
| } |
| package com.zhou.array; |
| |
| public class ArrayDemo04 { |
| public static void main(String[] args) { |
| int[] arrays = {1,2,3,4,5}; |
| |
| |
| for (int array : arrays) { |
| System.out.println(array); |
| } |
| } |
| } |
| package com.zhou.array; |
| |
| public class ArrayDemo04 { |
| public static void main(String[] args) { |
| int[] arrays = {1,2,3,4,5}; |
| |
| |
| for (int array : arrays) { |
| System.out.println(array); |
| } |
| printArray(arrays); |
| } |
| |
| |
| public static void printArray(int arrays[]){ |
| for (int i=0;i<arrays.length;i++){ |
| System.out.print(arrays[i]+""); |
| } |
| } |
- 数组作返回值
- !!!引用类型一定要仔细观察内存地址是否发生变化!!!
| package com.zhou.array; |
| |
| public class ArrayDemo04 { |
| public static void main(String[] args) { |
| int[] arrays = {1,2,3,4,5}; |
| |
| |
| for (int array : arrays) { |
| System.out.println(array); |
| } |
| |
| int[] reveser = reverse(arrays); |
| printArray(reveser); |
| |
| } |
| |
| |
| public static void printArray(int arrays[]){ |
| for (int i=0;i<arrays.length;i++){ |
| System.out.print(arrays[i]+""); |
| } |
| } |
| |
| |
| public static int[] reverse(int[] arrays){ |
| int[] result = new int[arrays.length]; |
| |
| |
| for (int i = 0,j=arrays.length-1;i<arrays.length;i++,j--) { |
| |
| result[j] = arrays[i]; |
| } |
| |
| |
| return result; |
| } |
| } |
| package com.zhou.day0815; |
| |
| |
| |
| public class Demo04 { |
| public static void main(String[] args) { |
| int[] array = {1,2,3,4,5,6,7,8,9}; |
| int[] array1 = reverse(array); |
| for (int i = 0;i<array1.length;i++){ |
| System.out.print(array1[i]+"\t"); |
| } |
| } |
| public static int[] reverse(int[] arrays){ |
| int[] result = new int[arrays.length]; |
| for (int i = 0,j = arrays.length-1;i<arrays.length;i++,j--) { |
| result[j] = arrays[i]; |
| return result; |
| } |
| |
| |
| int[] arr = {1,2,3,4,5}; |
| reverse(arr); |
| |
| System.out.println(arr); |
| System.out.println("====================="); |
| |
| printArray(arr); |
| } |
| public static void reverse(int[] a){ |
| int temp = a[0]; |
| a[0] = a[4]; |
| a[4] = temp; |
| temp = a[1]; |
| a[1] = a[3]; |
| a[3] = temp; |
| } |
| |
| public static void printArray(int[] arr){ |
| for (int i = 0;i<arr.length;i++){ |
| System.out.println(arr[i]); |
| } |
| } |
| } |
英文小扩展
word
本文作者:小周和java
本文链接:https://www.cnblogs.com/xzandjava/p/16588547.html
版权声明:本作品采用知识共享署名-非商业性使用-禁止演绎 2.5 中国大陆许可协议进行许可。
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 阿里最新开源QwQ-32B,效果媲美deepseek-r1满血版,部署成本又又又降低了!
· AI编程工具终极对决:字节Trae VS Cursor,谁才是开发者新宠?
· 开源Multi-agent AI智能体框架aevatar.ai,欢迎大家贡献代码
· Manus重磅发布:全球首款通用AI代理技术深度解析与实战指南
· 被坑几百块钱后,我竟然真的恢复了删除的微信聊天记录!