ARST13

A算法学了点,有点多,主要是回忆:开始刷题模式:linked list,stack,queue,priority queue,map(python:映射)set(python:集合)The Binary Three,Binary Search Three,GraphValid Parentheses1. def isValid(self,s): stack = [] paren

- 阅读全文 -

ARST12

A987Vertical Order Traversal of a Binary TreeGiven a binary tree, return the vertical order traversal of its nodes values.For each node at position (X, Y), its left and right children respectively wil

- 阅读全文 -

ARST7

A98.Validate Binary Search TreeGiven a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less

- 阅读全文 -

ARST6

A:这道题感觉特别经典,方法实在是多,很具有开阔思维的题70.climbing StairsYou are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb t

- 阅读全文 -

ARST5

A:641.Design Circular Deque//题目说的很明白:设计一个循环队列,并且满足如下条条件,同时设计操作循环队列的函数。1.思路循环队列的定义满足什么条件,就是需要哪些结构知识点2.各个函数之间操作,考虑哪些边界条件.3.本题目画个图基本就出来了class MyCircularDeque{int size; int k; DoubleListNode head; DoubleL

- 阅读全文 -

最新文章

最近回复

分类

标签

归档

其它

  • 熊熊的个人博客
  • Hanny's Blog