程序媛詹妮弗
终身学习
摘要: 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) 编辑
摘要: Given two arrays, write a function to compute their intersection. Example 1: Example 2: Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4] Output: [9,4] Exam 阅读全文
posted @ 2018-10-18 14:45 程序媛詹妮弗 阅读(177) 评论(0) 推荐(0) 编辑
摘要: Given a non-empty binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some starting node to any 阅读全文
posted @ 2018-10-18 14:32 程序媛詹妮弗 阅读(328) 评论(0) 推荐(0) 编辑
摘要: The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. Given an integer n, return the 阅读全文
posted @ 2018-10-18 14:28 程序媛詹妮弗 阅读(173) 评论(0) 推荐(0) 编辑
摘要: Design a data structure that supports the following two operations: search(word) can search a literal word or a regular expression string containing o 阅读全文
posted @ 2018-10-18 14:16 程序媛詹妮弗 阅读(122) 评论(0) 推荐(0) 编辑
摘要: Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next() will return the n 阅读全文
posted @ 2018-10-18 14:11 程序媛詹妮弗 阅读(129) 评论(0) 推荐(0) 编辑
摘要: Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k. Example 1: Note: 题目 和为K的 阅读全文
posted @ 2018-10-18 14:05 程序媛詹妮弗 阅读(172) 评论(0) 推荐(0) 编辑
摘要: In a given array nums of positive integers, find three non-overlapping subarrays with maximum sum. Each subarray will be of size k, and we want to max 阅读全文
posted @ 2018-10-18 14:04 程序媛詹妮弗 阅读(105) 评论(0) 推荐(0) 编辑
摘要: Given a string s and a non-empty string p, find all the start indices of p's anagrams in s. Strings consists of lowercase English letters only and the 阅读全文
posted @ 2018-10-18 13:56 程序媛詹妮弗 阅读(102) 评论(0) 推荐(0) 编辑
摘要: Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome. Example 1: Example 2: 思路: 代码: 阅读全文
posted @ 2018-10-18 07:36 程序媛詹妮弗 阅读(97) 评论(0) 推荐(0) 编辑
摘要: Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element. Example 阅读全文
posted @ 2018-10-18 07:24 程序媛詹妮弗 阅读(101) 评论(0) 推荐(0) 编辑
摘要: Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You may not modify the values in the list's nodes, only nodes its 阅读全文
posted @ 2018-10-18 07:21 程序媛詹妮弗 阅读(116) 评论(0) 推荐(0) 编辑
摘要: Convert a BST to a sorted circular doubly-linked list in-place. Think of the left and right pointers as synonymous to the previous and next pointers i 阅读全文
posted @ 2018-10-18 06:40 程序媛詹妮弗 阅读(120) 评论(0) 推荐(0) 编辑
摘要: Given a positive integer n, generate a square matrix filled with elements from 1 to n^2 in spiral order. Example: 题意: 给定n, 把1至n ^ 2所有的数,按照螺旋顺序填入方阵。 co 阅读全文
posted @ 2018-10-18 06:28 程序媛詹妮弗 阅读(134) 评论(0) 推荐(0) 编辑
摘要: The API: int read4(char *buf) reads 4 characters at a time from a file. The return value is the actual number of characters read. For example, it retu 阅读全文
posted @ 2018-10-18 06:25 程序媛詹妮弗 阅读(120) 评论(0) 推荐(0) 编辑