Data structure and algorithm array Foundation

xbhog 2021-01-21 12:13:09
data structure algorithm array foundation


Array basis :

Reading guide :

Start the winter vacation , Prepare to open a summary of data structure and algorithm , Record this boring winter vacation study ;

Don't talk much , Let's start with arrays ;

I hope we can stick to it !

Basic use of array :

First, for arrays , We need to know its basic rules and application ;

public static void main(String[] args) {
// Create an array
int[] num = new int[3];
// Get array length
int length1 = num.length;
System.out.println(" The length of the array :"+length1);
// Assign values to elements in an array
num[0]=99;
num[1]=98;
num[2]=97;
// Traversal array
for (int i=0;i<length1;i++){
System.out.printf(" Array elements [%d]:%d",i,num[i]);
}
System.out.println();
// When you create an array, you assign values directly
int[] arr = {99,98,97,22};
System.out.println("arr lenght:"+arr.length);
}

The elements of the array are added :

When you know the basics of arrays , We need to add in the array 、 Delete 、 Insert 、 Work hard on the inquiry ;

public static void main(String[] args) {
// Solve the problem of immutable array length
int[] arr = {9,8,7};
// Quick view of elements in an array
System.out.println(Arrays.toString(arr));
// The elements to be added
int dst = 6;
// Create a new array , The length is the length of the original array +1
int[] newArr = new int[arr.length+1];
// Add all the data in the original array to the new array
for(int i=0;i<arr.length;i++){
newArr[i] = arr[i];
}
System.out.println(Arrays.toString(newArr));
// Put the target element at the end of the new array
newArr[arr.length] = dst;
// The new array replaces the original array
arr = newArr;
System.out.println(Arrays.toString(arr));
}

Array element deletion :

public static void main(String[] args) {
// Target array
int[] arr = {9,8,7,6,5,4};
// To remove the subscript of an array
int dst = 0;
System.out.println(Arrays.toString(arr));
// Create a new array , The length is the original array length -1
int[] newarr = new int[arr.length-1];
// Assign values to elements other than the one to be deleted from the original array
for(int i=0;i<newarr.length;i++){
// The element before the element to be deleted
if(i<dst){
newarr[i] = arr[i];
}else{
// The element after the element to be deleted
newarr[i] = arr[i+1];
}
}
// New array replaces old array
arr = newarr;
System.out.println(Arrays.toString(arr));
}

The elements of an array are inserted :

public static void main(String[] args) {
// Target array
int[] arr = {1,3,2,4,5,8};
System.out.println(Arrays.toString(arr));
// The location where the element needs to be inserted
int dst = 2;
// Insert new elements
int data = 99;
// New array
int[] newarr = new int [arr.length+1];
for (int i=0;i<arr.length;i++){
if (i <dst){
newarr[i] = arr[i];
}else{
newarr[i+1] = arr[i];
}
}
newarr[dst] = data;
arr = newarr;
System.out.println(Arrays.toString(arr));
}

The above examples are not explained too much , If there is Java Basic words , It's easy to understand ;

For the above knowledge , We implement a simple version of the addition, deletion, modification and query ;

Array upgrade :

Constructor part :

package JavaDataStructure.arrayUpgrade;
import java.util.Arrays;
public class MyArray {
private int[] array;
// Initialize array
public MyArray() {
array = new int[0];
}
// Get array length method
public int getLength(){
return array.length;
}
// Look at the array information
public void show(){
System.out.println(Arrays.toString(array));
}
// Add data to the end of the array
public void add(int data){
// Apply for a new array , The length is longer than the original array length +1
int[] newarr = new int[array.length+1];
// Save all the data in the original array to the new array
for(int i=0;i<array.length;i++){
newarr[i] = array[i];
}
// Add the added data to the end of the new array , The length of the original array is just the position of the last data
newarr[array.length] = data;
array = newarr;
}
// Find element subscripts in an array
public int search(int data){
int index=-1;
for (int i=0;i<array.length;i++){
if(array[i]==data){
index=i;
}
}
return index;
}
// Delete the data in the array
public void delete(int data){
int index=search(data);
// Check if the array has data
if(index<0 || index>array.length-1){
// Exception alert
throw new RuntimeException(" The subscript crossing the line !");
}
// Apply for a new array
int[] newarr = new int[array.length-1];
for (int i=0;i<newarr.length;i++){
if (i<index){
newarr[i] = array[i];
}else{
// Want to delete the element after the element
newarr[i] = array[i+1];
}
}
// New array replaces old array
array = newarr;
}
public void insert(int index,int data){
int[] newarr = new int[array.length+1];
// Put the elements in the original array into the new array
for (int i=0;i<array.length;i++){
// Put the element before the subscript into a new array
if (i<index){
newarr[i] = array[i];
}else{
// Put the elements inserted after the subscript into a new array , You need to leave a place before you put it
newarr[i+1] = array[i];
}
}
// Insert new elements
newarr[index] = data;
// The new array replaces the old array
array = newarr;
}
// Replacement elements
public void set(int index,int data){
if(index<0 || index >array.length){
throw new RuntimeException(" The subscript crossing the line !");
}
array[index-1] = data;
}
}

Test function section :

package JavaDataStructure.arrayUpgrade;
import JavaDataStructure.arrayUpgrade.MyArray;
public class TestMyarray {
public static void main(String[] args) {
// Instantiate array objects
MyArray ma = new MyArray();
// Add data to the end of the array
ma.add(3);
ma.add(2);
ma.add(11);
// Show the elements in the array
ma.show();
// Displays the subscript of the lookup element
// System.out.println(ma.search(4));
// Displays the current array size
System.out.println(ma.getLength());
// Delete operation
ma.delete(2);
ma.show();
// The insert
ma.insert(0,4);
ma.insert(2,42);
ma.show();
// Replace the element at the specified location
ma.set(4,33);
ma.show();
}
}

end :

Make a little progress every day , I hope you have something to gain .....

版权声明
本文为[xbhog]所创,转载请带上原文链接,感谢
https://javamana.com/2021/01/20210121120754006Z.html

  1. 【计算机网络 12(1),尚学堂马士兵Java视频教程
  2. 【程序猿历程,史上最全的Java面试题集锦在这里
  3. 【程序猿历程(1),Javaweb视频教程百度云
  4. Notes on MySQL 45 lectures (1-7)
  5. [computer network 12 (1), Shang Xuetang Ma soldier java video tutorial
  6. The most complete collection of Java interview questions in history is here
  7. [process of program ape (1), JavaWeb video tutorial, baidu cloud
  8. Notes on MySQL 45 lectures (1-7)
  9. 精进 Spring Boot 03:Spring Boot 的配置文件和配置管理,以及用三种方式读取配置文件
  10. Refined spring boot 03: spring boot configuration files and configuration management, and reading configuration files in three ways
  11. 精进 Spring Boot 03:Spring Boot 的配置文件和配置管理,以及用三种方式读取配置文件
  12. Refined spring boot 03: spring boot configuration files and configuration management, and reading configuration files in three ways
  13. 【递归,Java传智播客笔记
  14. [recursion, Java intelligence podcast notes
  15. [adhere to painting for 386 days] the beginning of spring of 24 solar terms
  16. K8S系列第八篇(Service、EndPoints以及高可用kubeadm部署)
  17. K8s Series Part 8 (service, endpoints and high availability kubeadm deployment)
  18. 【重识 HTML (3),350道Java面试真题分享
  19. 【重识 HTML (2),Java并发编程必会的多线程你竟然还不会
  20. 【重识 HTML (1),二本Java小菜鸟4面字节跳动被秒成渣渣
  21. [re recognize HTML (3) and share 350 real Java interview questions
  22. [re recognize HTML (2). Multithreading is a must for Java Concurrent Programming. How dare you not
  23. [re recognize HTML (1), two Java rookies' 4-sided bytes beat and become slag in seconds
  24. 造轮子系列之RPC 1:如何从零开始开发RPC框架
  25. RPC 1: how to develop RPC framework from scratch
  26. 造轮子系列之RPC 1:如何从零开始开发RPC框架
  27. RPC 1: how to develop RPC framework from scratch
  28. 一次性捋清楚吧,对乱糟糟的,Spring事务扩展机制
  29. 一文彻底弄懂如何选择抽象类还是接口,连续四年百度Java岗必问面试题
  30. Redis常用命令
  31. 一双拖鞋引发的血案,狂神说Java系列笔记
  32. 一、mysql基础安装
  33. 一位程序员的独白:尽管我一生坎坷,Java框架面试基础
  34. Clear it all at once. For the messy, spring transaction extension mechanism
  35. A thorough understanding of how to choose abstract classes or interfaces, baidu Java post must ask interview questions for four consecutive years
  36. Redis common commands
  37. A pair of slippers triggered the murder, crazy God said java series notes
  38. 1、 MySQL basic installation
  39. Monologue of a programmer: despite my ups and downs in my life, Java framework is the foundation of interview
  40. 【大厂面试】三面三问Spring循环依赖,请一定要把这篇看完(建议收藏)
  41. 一线互联网企业中,springboot入门项目
  42. 一篇文带你入门SSM框架Spring开发,帮你快速拿Offer
  43. 【面试资料】Java全集、微服务、大数据、数据结构与算法、机器学习知识最全总结,283页pdf
  44. 【leetcode刷题】24.数组中重复的数字——Java版
  45. 【leetcode刷题】23.对称二叉树——Java版
  46. 【leetcode刷题】22.二叉树的中序遍历——Java版
  47. 【leetcode刷题】21.三数之和——Java版
  48. 【leetcode刷题】20.最长回文子串——Java版
  49. 【leetcode刷题】19.回文链表——Java版
  50. 【leetcode刷题】18.反转链表——Java版
  51. 【leetcode刷题】17.相交链表——Java&python版
  52. 【leetcode刷题】16.环形链表——Java版
  53. 【leetcode刷题】15.汉明距离——Java版
  54. 【leetcode刷题】14.找到所有数组中消失的数字——Java版
  55. 【leetcode刷题】13.比特位计数——Java版
  56. oracle控制用户权限命令
  57. 三年Java开发,继阿里,鲁班二期Java架构师
  58. Oracle必须要启动的服务
  59. 万字长文!深入剖析HashMap,Java基础笔试题大全带答案
  60. 一问Kafka就心慌?我却凭着这份,图灵学院vip课程百度云