JAVA数据结构（六）-CSDN博客

本文链接：https://blog.csdn.net/youquanshui8285/article/details/93379129

集合与映射

一、集合
同样，可以通过二分搜索树实现（底层实现是有多种方式的）
在这里插入图片描述

将集合需要实现的功能抽象为一个接口

package cn.itcast.day6;

public interface Set<E> {
	void add(E e);
	void remove(E e);
	boolean contains(E e);
	int getSize();
	boolean isEmpty();
}

利用二分搜索树实现Set

package cn.itcast.day6;

public class BSTSet<E extends Comparable<E>> implements Set<E> {
	private BST<E> bst;
	public BSTSet() {
		bst = new BST<E>();
	}
	@Override
	public int getSize() {
		return bst.size();
	}
	@Override
	public boolean isEmpty() {
		return bst.isEmpty();
	}
	@Override
	public void add(E e) {
		bst.add(e);
	}
	@Override
	public boolean contains(E e) {
		return bst.contains(e);
	}
	@Override
	public void remove(E e) {
		bst.remove(e);
	}
}

利用链表实现一个Set
代码实现

package cn.itcast.day6;

import cn.itcast.day3.LinkedList;

public class LinkedListSet<E> implements Set<E> {
	private LinkedList<E> list;
	
	public LinkedListSet() {
		list = new LinkedList<>();
	}

	@Override
	public void add(E e) {
		if(!list.contains(e)) {
			list.addFirst(e);
		}
	}

	@Override
	public void remove(E e) {
		list.removeElement(e);
	}

	@Override
	public boolean contains(E e) {

		return list.contains(e);
	}

	@Override
	public int getSize() {

		return list.getSize();
	}

	@Override
	public boolean isEmpty() {
		return list.isEmpty();
	}
	
}

二、唯一摩尔斯密码词
leetCode804题：唯一摩尔斯密码词

代码实现

class Solution {
    public int uniqueMorseRepresentations(String[] words) {
        String[] codes = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
		TreeSet<String> set = new TreeSet<>();
		for(String word:words) {
			StringBuilder res = new StringBuilder();
			for(int i=0;i<word.length();i++) {
				res.append(codes[word.charAt(i)-'a']);	//word.charAt(i)-'a'是根据ascii码值来确定索引位置
			}
			set.add(res.toString());
		}
		return set.size();
    }
}

有序集合与无序集合

三、映射Map（字典）
使用链表或二分搜索树：

对于映射，同样使用接口来给出定义。需要实现的方法
利用链表实现映射的集合类

package cn.itcast.day6;

public class LinkedListMap<K,V> implements Map<K,V> {
	private class Node{
		public K key;
		public V value;
		public Node next;
		
		public Node(K key,V value,Node next) {
			this.key = key;
			this.value = value;
			this.next = next
		}
		public Node(K key) {
			this(key,null,null);
		}
		public Node() {
			this(null,null,null);
		}
		@Override
		public String toString() {
			return key.toString()+":"+value.toString();
		}
	}
	private Node dummyHead;
	private int size;
	
	public LinkedListMap() {
		dummyHead = new Node();
		size = 0;
	}
	@Override
	public int getSize() {
		return size;
	}
	@Override
	public boolean isEmpty() {
		return size==0;
	}
	
	private Node getNode(K key) {
		Node cur = dummyHead.next;
		while(cur!=null) {
			if(cur.key.equals(key)) {
				return cur;
			}
			cur = cur.next;
		}
		return null;
	}
	@Override
	public boolean contains(K key) {
		return getNode(key)!=null;
	}
	@Override
	public V get(K key) {
		Node node = getNode(key);
		return node == null?null:node.value;
	}
	@Override
	public void add(K key, V value) {
		Node node = getNode(key);
		if(node==null) {
			dummyHead.next = new Node(key,value,dummyHead.next);
			size++;
		}
		else {
			node.value = value;
		}
	}
	@Override
	public void set(K key, V newValue) {
		Node node = getNode(key);
		if(node ==null) {
			throw new IllegalArgumentException(key+" doesn't exist!");
		}
		node.value = newValue;
	}
	@Override
	public V remove(K key) {
		Node prev = dummyHead;
		while(prev.next!=null) {
			if(prev.next.key.equals(key)) {
				break;
			}
			prev = prev.next;
		}
		if(prev.next!=null) {
			Node delNode = prev.next;
			prev.next = delNode.next;
			delNode.next = null;
			size --;
			return delNode.value;
		}
		return null;
	}
}

利用二分搜索树实现Map

package cn.itcast.day6;

public class BSTMap<K extends Comparable<K>,V> implements Map<K,V> {
	private class Node{
		public K key;
		public V value;
		public Node left,right;
		
		public Node(K key,V value) {
			this.key = key;
			this.value = value;
			left = null;
			right = null;
		}
	}
	private Node root;
	private int size;
	
	@Override
	public int getSize() {
		return size;
	}
	@Override
	public boolean isEmpty() {
		return size==0;
	}
	
	//向二分搜索树中添加新的元素e
	@Override
	public void add(K key, V value) {
		// TODO Auto-generated method stub
		root = add(root,key,value);
	}
	private Node add(Node node,K key,V value) {
		if(node == null) {
			size++;
			return new Node(key,value);
		}
		if(key.compareTo(node.key)<0) {
			node.left = add(node.left,key,value);
		}else if(key.compareTo(node.key)>0) {
			node.right = add(node.right,key,value);
		} else {
			node.value = value;
		}
		return node;
	}
	
	//返回以node为根节点的二分搜索树种，key所在的节点
	private Node getNode(Node node,K key) {
		if(node == null) {
			return null;
		}
		if(key.compareTo(node.key) == 0) {
			return node;
		}
		else if(key.compareTo(node.key)<0) {
			return getNode(node.left,key);
		}
		else{
			return getNode(node.right,key);
		}
	}
	
	@Override
	public boolean contains(K key) {
		return getNode(root,key) != null;
	}
	@Override
	public V get(K key) {
		Node node = getNode(root,key);
		return node == null?null:node.value;
	}
	@Override
	public void set(K key, V newValue) {
		Node node = getNode(root,key);
		if(node==null) {
			throw new IllegalArgumentException(key+" doesn't exists" );
		}else {
			node.value = newValue;
		}
	}
	
	//返回以node为根的二分搜索树的最小值所在的节点
	private Node minimum(Node node) {
		if(node.left==null) {
			return node;
		}
		return minimum(node.left);
	}
	//删除掉以node为根的二分搜索树种的最小节点
	//返回删除节点后新的二分搜索树的根
	private Node removeMin(Node node) {
		if(node.left==null) {
			Node cur = node.right;
			node.right =null; //将此右节点删除
			size--;
			return cur;
		}
		node.left = removeMin(node.left);
		return node;
	}
	//从二分搜索树种删除元素为e的节点
	public V remove(K key) {
		Node node = getNode(root,key);
		if(node!=null) {
			root = remove(root,key);
			return root.value;
		}
		return null;
	}
	private Node remove(Node node,K key) {
		if(node == null) {
			return null;
		}
		if(key.compareTo(node.key)<0) {
			node.left = remove(node.left,key);
			return node;
		}else if(key.compareTo(node.key)>0) {
			node.right = remove(node.right,key);
			return node;
		}else { // 找到了需要删除的节点
			if(node.left == null) {
				Node rightNode = node.right;
				node.right = null;
				size --;
				return rightNode;
			}else if(node.right == null) {
				Node leftNode = node.left;
				node.left = null;
				size--;
				return leftNode;
			}else {
				Node successor = minimum(node.right);
				successor.right = removeMin(node.right);
				successor.left = node.left;
				node.left = node.right = null;
				return successor;
			}
		}
	}
	
}

有序映射与无序映射
集合与映射

四、更多关于集合、映射的leetCode题
349.求两个数组的交集
代码实现

package cn.itcast.LeetCode;

import java.util.ArrayList;
import java.util.TreeSet;

public class Solution {
	public int[] intersection(int[] nums1,int[] nums2) {
		TreeSet<Integer> set = new TreeSet<>();
		for(int num:nums1) {
			set.add(num);
		}
		ArrayList<Integer> list = new ArrayList<>();
		for(int num:nums2) {
			if(set.contains(num)) {
				list.add(num);
				set.remove(num);
			}
		}
		int[] result = new int[list.size()];
		for(int i=0;i<list.size();i++) {
			result[i] = list.get(i);
		}
		return result;
	}
}

350.求两个数组的交集2

代码实现

class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
        TreeMap<Integer,Integer> map = new TreeMap<>();
        for(int num:nums1) {
        	if(map.containsKey(num)) {
        		map.put(num,(map.get(num))+1);
        	}else {
        		map.put(num, 1);
        	}
        }
        ArrayList<Integer> list = new ArrayList<Integer>();
        for(int num:nums2) {
        	if(map.containsKey(num)) {
        		list.add(num);	//若包含此元素，则将元素添加到list中
        		map.put(num, map.get(num)-1);	//在nums2中每找到一个树，就把nums1中的个数减1
        		if(map.get(num)==0) {	//如果发现当前这个数出现的频数为0，表示已经没有该重复元素了，则将这个键删除
        			map.remove(num);
        		}
        	}
        }
        int[] res = new int[list.size()];
        for(int i=0;i<list.size();i++) {
        	res[i] = list.get(i);
        }
        return res;
    }
}