
1.对数组元素进行复制;然后修改指定位置的元素为添加元素
| package Program.product01; |
| |
| public class Demo1 { |
| public static void main(String[] args) { |
| int arrs[] ={1,2,3,4,5,6,7,8}; |
| System.out.print("打印交换位置前的字符:\n"); |
| for(int i =0;i<=arrs.length-1;i++) |
| { |
| |
| if(i!= arrs.length-1) |
| { |
| System.out.print(arrs[i]+","); |
| } |
| else { |
| System.out.println(arrs[i]); |
| } |
| |
| } |
| int index = 3; |
| |
| for(int i = arrs.length-1;i>=index+1;i--) |
| { |
| |
| arrs[i]=arrs[i-1]; |
| |
| } |
| arrs[index] =0; |
| |
| |
| System.out.print("\n打印交换位置后的字符:\n"); |
| for(int i =0;i<=arrs.length-1;i++) |
| { |
| if(i!= arrs.length-1) |
| { |
| System.out.print(arrs[i]+","); |
| } |
| else { |
| System.out.println(arrs[i]); |
| } |
| } |
| |
| } |
| } |
| |
| |
| |
| |
- 对一种的方法进行调用:
| package Program.product01; |
| |
| public class Demo1 { |
| public static void eleIndex(int []arrs,int index,int ele) { |
| for (int i = arrs.length - 1; i >= index + 1; i--) { |
| arrs[i] = arrs[i - 1]; |
| } |
| arrs[index] = ele; |
| } |
| public static void main(String[] args) { |
| int arrs[] = {1, 2, 3, 4, 5, 6, 7, 8}; |
| System.out.print("打印交换位置前的字符:\n"); |
| for (int i = 0; i <= arrs.length - 1; i++) { |
| |
| if (i != arrs.length - 1) { |
| System.out.print(arrs[i] + ","); |
| } else { |
| System.out.println(arrs[i]); |
| } |
| |
| } |
| eleIndex(arrs,2,666); |
| System.out.print("\n打印交换位置后的字符:\n"); |
| for (int i = 0; i <= arrs.length - 1; i++) { |
| if (i != arrs.length - 1) { |
| System.out.print(arrs[i] + ","); |
| } else { |
| System.out.println(arrs[i]); |
| } |
| } |
| |
| } |
| } |
| |
| |
| |
| |
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 分享一个免费、快速、无限量使用的满血 DeepSeek R1 模型,支持深度思考和联网搜索!
· 25岁的心里话
· 基于 Docker 搭建 FRP 内网穿透开源项目(很简单哒)
· 闲置电脑爆改个人服务器(超详细) #公网映射 #Vmware虚拟网络编辑器
· ollama系列01:轻松3步本地部署deepseek,普通电脑可用