上一页 1 ··· 27 28 29 30 31 32 33 34 35 ··· 76 下一页
摘要: A robot is located at the top left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any p 阅读全文
posted @ 2018-11-07 13:08 bernieloveslife 阅读(114) 评论(0) 推荐(0)
摘要: Given a string containing just the characters '(' and ')', find the length of the longest valid (well formed) parentheses substring. Example 1: Input: 阅读全文
posted @ 2018-11-07 13:08 bernieloveslife 阅读(219) 评论(0) 推荐(0)
摘要: Given preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. For example, 阅读全文
posted @ 2018-11-07 13:08 bernieloveslife 阅读(107) 评论(0) 推荐(0)
摘要: Given a sorted linked list, delete all duplicates such that each element appear only once. Example 1: Input: 1 1 2 Output: 1 2 Example 2: Input: 1 1 2 阅读全文
posted @ 2018-11-06 15:52 bernieloveslife 阅读(92) 评论(0) 推荐(0)
摘要: Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used. Note: All letters in hexadec 阅读全文
posted @ 2018-11-06 15:52 bernieloveslife 阅读(126) 评论(0) 推荐(0)
摘要: Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia: “The lowes 阅读全文
posted @ 2018-11-06 15:52 bernieloveslife 阅读(108) 评论(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-11-06 15:52 bernieloveslife 阅读(94) 评论(0) 推荐(0)
摘要: Given two non negative integers num1 and num2 represented as string, return the sum of num1 and num2. Note: 1. The length of both num1 and num2 is 9: 阅读全文
posted @ 2018-11-06 15:52 bernieloveslife 阅读(154) 评论(0) 推荐(0)
摘要: Suppose that a website contains two tables, the Customers table and the Orders table. Write a SQL query to find all customers who never order anything 阅读全文
posted @ 2018-11-05 15:14 bernieloveslife 阅读(129) 评论(0) 推荐(0)
摘要: Implement the following operations of a queue using stacks. push(x) Push element x to the back of queue. pop() Removes the element from in front of qu 阅读全文
posted @ 2018-11-05 15:14 bernieloveslife 阅读(119) 评论(0) 推荐(0)
上一页 1 ··· 27 28 29 30 31 32 33 34 35 ··· 76 下一页