Java数据结构
dcot
这个作者很懒,什么都没留下…
展开
-
LeetCode专题强化——数组
public int removeDuplicates(int[] nums) { int j = 0; int pre = -10001; int count = 0; for (int i = 0; i < nums.length; i++) { if (pre == nums[i]){ count++; if (count <= 2){ .原创 2021-04-02 15:57:45 · 105 阅读 · 0 评论 -
java简单链表
public class LinkedList<T> { Node<T> headNode = null; Node<T> tailNode = null; int count = 0; public LinkedList() { // TODO Auto-generated constructor stub tailNode = headNo...原创 2019-05-27 15:57:10 · 129 阅读 · 0 评论