fareast_mzh的博客

https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/submissions/ DeleteNode.php <?php /** * https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/ * Definition for a singly-linked list. * class ListNode { * public $v

* Tree.h // // Created by EDZ on 2021/4/2. // #ifndef DIAMETEROFTREE_TREE_H #define DIAMETEROFTREE_TREE_H #include "deque" //#ifndef max //#define max(a, b) ((a) > (b) ? (a) : (b)) //#endif template<class T> T max(T a, T b) { return a &..

&#13; 输入两个单调递增的链表，输出两个链表合成后的链表，当然我们需要合成后的链表满足单调不减规则。 &lt;?php class ListNode{ var $val; var $next = NULL; function __construct($x){ $this-&gt;val = $x; } } functi...

* BreadthFirstPaths.java package com.merrytech; import java.util.HashMap; import java.util.LinkedList; import java.util.Queue; import java.util.Stack; public class BreadthFirstPaths<E> { private final HashMap<E, Boolean> marked; // Is..

* DepthFirstPaths.java package com.merrytech; import java.util.HashMap; import java.util.Stack; public class DepthFirstPaths<E> { private final HashMap<E, Boolean> marked; // Has dfs() been called for the vertex? private final Has..

* Graph.java import java.util.HashSet; import java.util.Map; public class Graph<E> { private final int v; // number of vertices private int e; // number of edges private final HashMap<E, HashSet<E>> adj; // adjacency list..