Ruizhi Ma's Blog

Keep Calm and Carry On

Problem 346

Solution URL https://leetcode.com/submissions/detail/415226772/ 代码 class MovingAverage { //Ans: Solution int size; List<Integer> q = new ArrayList<>(); /** Initializ...

Problem 284

Solution URL https://leetcode.com/submissions/detail/415269877/ 代码 // Java Iterator interface reference: // https://docs.oracle.com/javase/8/docs/api/java/util/Iterator.html import java.util.No...

Implement of Stack

package test; public class MyStack<T> { //initialize T[] arr = null; public MyStack(){ arr = (T[])new Object[0]; } //PUSH public void push(T element) { //create a new array 1 lon...

Implement of Queue

package test; public class MyQueue<T> { //initialize T[] arr = null; public MyQueue(){ arr = (T[])new Object[0]; } // ADD/OFFER Func public void add(T element) { //create...

Problem 382

Solution URL https://leetcode.com/submissions/detail/414924624/ 代码 /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode() {}...

Implement of List

package test; public class MyList { Node head = null; //initialize the node class Node{ Node next = null; int data; public Node(int data) { this.data = data; } } //add node at t...

Implement of Array

package test; import java.util.Arrays; public class MyArray { private int[] arr; // initialize public MyArray() { arr = new int[0]; } //Add public void add(int nums) { // create an ne...

Problem 398

Solution URL https://leetcode.com/submissions/detail/414688374/ 代码 class Solution { //ans: https://leetcode-cn.com/problems/random-pick-index/solution/398-sui-ji-shu-suo-yin-sui-ji-ming-zhon...

Problem 384

Solution URL https://leetcode.com/submissions/detail/414663708/ 代码 class Solution { private int[] arr; private int[] original; Random rand = new Random(); public Solution(int[...

Problem 210

Solution URL https://leetcode.com/submissions/detail/414627437/ 代码 class Solution { public int[] findOrder(int numCourses, int[][] prerequisites) { //https://www.youtube.com/watch?v=...