上一页 1 ··· 36 37 38 39 40 41 42 43 44 ··· 76 下一页
摘要: On a N N grid, we place some 1 1 1 cubes that are axis aligned with the x, y, and z axes. Each value v = grid[i][j] represents a tower of v cubes plac 阅读全文
posted @ 2018-10-20 11:51 bernieloveslife 阅读(112) 评论(0) 推荐(0)
摘要: Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Given linked list head = [4,5,1,9], which 阅读全文
posted @ 2018-10-20 11:51 bernieloveslife 阅读(82) 评论(0) 推荐(0)
摘要: Given an array nums of n integers where n 1, return an array output such that output[i] is equal to the product of all the elements of nums except num 阅读全文
posted @ 2018-10-20 11:51 bernieloveslife 阅读(79) 评论(0) 推荐(0)
摘要: Given a non empty array of integers, return the k most frequent elements. Example 1: Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2] Example 2: Input 阅读全文
posted @ 2018-10-19 10:30 bernieloveslife 阅读(176) 评论(0) 推荐(0)
摘要: Implement a basic calculator to evaluate a simple expression string. The expression string may contain open ( and closing parentheses ), the plus + or 阅读全文
posted @ 2018-10-19 10:29 bernieloveslife 阅读(111) 评论(0) 推荐(0)
摘要: Implement a basic calculator to evaluate a simple expression string. The expression string contains only non negative integers, +, , , / operators and 阅读全文
posted @ 2018-10-19 10:29 bernieloveslife 阅读(86) 评论(0) 推荐(0)
摘要: Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R = L). You might 阅读全文
posted @ 2018-10-19 10:29 bernieloveslife 阅读(107) 评论(0) 推荐(0)
摘要: Given a directed, acyclic graph of N nodes. Find all possible paths from node 0 to node N 1, and return them in any order. The graph is given as follo 阅读全文
posted @ 2018-10-19 10:29 bernieloveslife 阅读(168) 评论(0) 推荐(0)
摘要: Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix. Note that it is th 阅读全文
posted @ 2018-10-18 11:23 bernieloveslife 阅读(87) 评论(0) 推荐(0)
摘要: Given a string, find the first non repeating character in it and return it's index. If it doesn't exist, return 1. Examples: s = "leetcode" return 0. 阅读全文
posted @ 2018-10-18 11:23 bernieloveslife 阅读(93) 评论(0) 推荐(0)
上一页 1 ··· 36 37 38 39 40 41 42 43 44 ··· 76 下一页