Just DO IT by luckygxf

摘要： 归并两个有序序列为一个有序序列Merge Two Sorted ListsMerge two sorted linked lists and return it as a new list. The new list should be made by splicing together the n... 阅读全文

摘要： Binary Tree Level Order TraversalGiven a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).Fo... 阅读全文

摘要： 这道题A的略烦Binary Tree Level Order Traversal IIGiven a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right... 阅读全文

摘要： 图和图的遍历算法1.存储结构(邻接链表)1.1每个顶点用VexNode类表示，每条边用ArcNode表示1.2所有顶点用数组VexNode adjlist[]表示，所有邻接顶点用链表表示2.遍历算法2.1深度优先遍历DFS用递归实现，从V0开始，访问V0即邻接顶点V1，访问V1及其邻接顶点...2.... 阅读全文

摘要： Remove Duplicates from Sorted ListGiven a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given1->1->2, r... 阅读全文

摘要： Binary Tree Preorder TraversalGiven a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ ... 阅读全文

摘要： Merge Sorted ArrayGiven two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that i... 阅读全文

摘要： Same TreeGiven two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally ide... 阅读全文

摘要： 归并排序1.将两个有序序列归并成一个有序序列2.将带排序数组，通过递归调整成左右两个有序序列，在调用归并算法，将其归并成一个有序序列，完成排序Merg.java 1 package com.gxf.merg; 2 3 /** 4 * 归并排序 5 * 初始状态，将数组看成n个单独有序的序列，两... 阅读全文

摘要： Maximum Depth of Binary TreeGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root ... 阅读全文