程序媛詹妮弗
终身学习
上一页 1 ··· 14 15 16 17 18 19 20 21 22 ··· 30 下一页
摘要: Given an undirected graph, return true if and only if it is bipartite. 设G=(V,E)是一个无向图。如顶点集V可分割为两个互不相交的子集V1,V2之并,并且图中每条边依附的两个顶点都分别属于这两个不同的子集 思路 1. base 阅读全文
posted @ 2018-10-19 08:04 程序媛詹妮弗 阅读(198) 评论(0) 推荐(0) 编辑
摘要: Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put. get(key) - Get the 阅读全文
posted @ 2018-10-19 07:19 程序媛詹妮弗 阅读(211) 评论(0) 推荐(0) 编辑
摘要: Given 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 阅读全文
posted @ 2018-10-19 06:14 程序媛詹妮弗 阅读(108) 评论(0) 推荐(0) 编辑
摘要: You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality c 阅读全文
posted @ 2018-10-19 05:44 程序媛詹妮弗 阅读(126) 评论(0) 推荐(0) 编辑
摘要: Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that 阅读全文
posted @ 2018-10-18 16:29 程序媛詹妮弗 阅读(276) 评论(0) 推荐(0) 编辑
摘要: Suppose you are at a party with n people (labeled from 0 to n - 1) and among them, there may exist one celebrity. The definition of a celebrity is tha 阅读全文
posted @ 2018-10-18 15:43 程序媛詹妮弗 阅读(147) 评论(0) 推荐(0) 编辑
摘要: Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA on Wikipedia 阅读全文
posted @ 2018-10-18 15:31 程序媛詹妮弗 阅读(95) 评论(0) 推荐(0) 编辑
摘要: Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator. Return the quotient after dividi 阅读全文
posted @ 2018-10-18 15:16 程序媛詹妮弗 阅读(125) 评论(0) 推荐(0) 编辑
摘要: Validate if a given string can be interpreted as a decimal number. Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => true" 阅读全文
posted @ 2018-10-18 15:07 程序媛詹妮弗 阅读(296) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column). If two nodes are in the sam 阅读全文
posted @ 2018-10-18 15:01 程序媛詹妮弗 阅读(107) 评论(0) 推荐(0) 编辑
上一页 1 ··· 14 15 16 17 18 19 20 21 22 ··· 30 下一页