上一页 1 ··· 12 13 14 15 16 17 18 19 20 ··· 24 下一页
摘要: 题目: Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the neares 阅读全文
posted @ 2019-02-22 15:47 林木声 阅读(112) 评论(0) 推荐(0)
摘要: 题目: Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthes 阅读全文
posted @ 2019-02-22 15:42 林木声 阅读(92) 评论(0) 推荐(0)
摘要: 题目: Given a binary tree, determine if it is a valid Binary Search Tree (BST) 解答: 阅读全文
posted @ 2019-02-22 15:36 林木声 阅读(109) 评论(0) 推荐(0)
摘要: 题目: You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contains a si 阅读全文
posted @ 2019-02-21 14:52 林木声 阅读(118) 评论(0) 推荐(0)
摘要: 题目: Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists 解答: 阅读全文
posted @ 2019-02-21 14:34 林木声 阅读(275) 评论(0) 推荐(0)
摘要: 题目: Determine whether an integer is a palindrome. Do this without extra space 解答: First, compare the first and last digit. If they are not the same, i 阅读全文
posted @ 2019-02-21 14:28 林木声 阅读(170) 评论(0) 推荐(0)
摘要: 题目: Given a number represented as an array of digits, plus one to the number 解答: 阅读全文
posted @ 2019-02-21 14:15 林木声 阅读(139) 评论(0) 推荐(0)
摘要: 题目: Reverse digits of an integer. For example: x = 123, return 321 解答: 阅读全文
posted @ 2019-02-19 20:29 林木声 阅读(102) 评论(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 r 阅读全文
posted @ 2019-02-19 20:19 林木声 阅读(136) 评论(0) 推荐(0)
摘要: 题目: Given two strings S and T, determine if they are both one edit distance apart i. Modify operation – Modify a character to X in S.S = “abcde”T = “a 阅读全文
posted @ 2019-02-18 19:03 林木声 阅读(233) 评论(0) 推荐(0)
上一页 1 ··· 12 13 14 15 16 17 18 19 20 ··· 24 下一页