页面顶部 Top

世界那么大 我想去看看

定阅此目录的博客 或者 Feedburner

分类: 所有 | 乱七八糟(52) | 计算机科学(163) | 生活(35) | 成功(18) | 有意思(24) | 怀念(4) | 分享(60) | 情与爱(14) | 新闻资讯(84) | 名人名言(92) | 知识问答(26) | 健康(6) | 图片(5) | 故事(6) | 视频(13) | 虚拟货币-区块链(1) |
共: 163 - 统计 | 存档
« 前一页 ( 页数 : 1 2 3 4 5 6 7 8 9 10 .. ) 后一页 »

65 - 每日算法题: 3 Sum - 3-sum.txt.txt

Hi, here's your problem today. This problem was recently asked by Twitter:

Given an array, nums, of n integers, find all unique triplets (three numbers, a, b, & c) in nums such that a + b + c = 0. Note that there may not be any triplets that sum to zero in nums, and that the triplets must not be duplicates.

Example:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 1038 次阅读, 14263 次搜索 | 92 个单词

66 - 每日算法题: Word Ordering in a Different Alphabetical Order - word-ordering-in-a-different-alphabetical-order.txt.txt

Hi, here's your problem today. This problem was recently asked by Apple:

Given a list of words, and an arbitrary alphabetical order, verify that the words are in order of the alphabetical order.

Example:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 190 次阅读, 17419 次搜索 | 107 个单词

67 - 每日算法题: Sort Colors - sort-colors.txt.txt

Hi, here's your problem today. This problem was recently asked by Apple:

Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.

Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 522 次阅读, 14562 次搜索 | 118 个单词

68 - 每日算法题: Reconstrunct Binary Tree from Preorder and Inorder Traversals - reconstrunct-binary-tree-from-preorder-and-inorder-traversals.txt.txt

Hi, here's your problem today. This problem was recently asked by Microsoft:

You are given the preorder and inorder traversals of a binary tree in the form of arrays. Write a function that reconstructs the tree represented by these traversals.

Example:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 126 次阅读, 16115 次搜索 | 164 个单词

69 - 每日算法题: Count Number of Unival Subtrees - count-number-of-unival-subtrees.txt.txt

Hi, here's your problem today. This problem was recently asked by Microsoft:

A unival tree is a tree where all the nodes have the same value. Given a binary tree, return the number of unival subtrees in the tree.

For example, the following tree should return 5:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 165 次阅读, 14840 次搜索 | 135 个单词

70 - 每日算法题: Longest Substring With K Distinct Characters - longest-substring-with-k-distinct-characters.txt.txt

Hi, here's your problem today. This problem was recently asked by Amazon:

You are given a string s, and an integer k. Return the length of the longest substring in s that contains at most k distinct characters.

For instance, given the string:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, Longest Substring With K Distinct Characters算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 233 次阅读, 18390 次搜索 | 94 个单词

71 - 微信拉黑和删除有啥区别? - wechat-block.txt.txt

相信很多使用微信的读者都曾经拉黑过某人,更不用说删除好友了,虽然拉黑和删除都能起到拒绝接收对方信息的效果,但它们具体有什么异同呢?拉黑和删除之后,还可以收发消息吗?聊天记录还在吗?还可以重新添加吗?对方知道自己被我拉黑/删除吗?

为了解答这个困扰良久的未解之谜,12月4日,腾讯微信团队官微在微博科普了拉黑与删除的区别。

问:还可以收发信息吗?
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 微信, 拉黑, 删除, 区别, Wechat, Block, | 中文 | 480 次阅读, 16542 次搜索 | 356 个汉字

72 - 每日算法题: Get all Values at a Certain Height in a Binary Tree - get-all-values-at-a-certain-height-in-a-binary-tree.txt.txt

Hi, here's your problem today. This problem was recently asked by Amazon:

Given a binary tree, return all values given a certain height h.

Here's a starting point:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 199 次阅读, 19636 次搜索 | 81 个单词

73 - 每日算法题: Validate Binary Search Tree - validate-binary-search-tree.txt.txt

Hi, here's your problem today. This problem was recently asked by Facebook:

You are given the root of a binary search tree. Return true if it is a valid binary search tree, and false otherwise. Recall that a binary search tree has the property that all values in the left subtree are less than or equal to the root, and all values in the right subtree are greater than or equal to the root.

Here's a starting point:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 149 次阅读, 13461 次搜索 | 128 个单词

74 - 每日算法题: First Missing Positive Integer - first-missing-positive-integer.txt

Hi, here's your problem today. This problem was recently asked by Facebook:

You are given an array of integers. Return the smallest positive integer that is not present in the array. The array may contain duplicate entries.

For example, the input [3, 4, -1, 1] should return 2 because it is the smallest positive integer that doesn't exist in the array.
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 153 次阅读, 16261 次搜索 | 89 个单词

75 - 每日算法题: Look and Say Sequence - look-and-say-sequence.txt

Hi, here's your problem today. This problem was recently asked by Google:

A look-and-say sequence is defined as the integer sequence beginning with a single digit in which the next term is obtained by describing the previous term. An example is easier to understand:

Each consecutive value describes the prior value.
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 309 次阅读, 13994 次搜索 | 77 个单词

76 - 每日算法题: Deepest Node in a Binary Tree - deepest-node-in-a-binary-tree.txt

Hi, here's your problem today. This problem was recently asked by Google:

You are given the root of a binary tree. Return the deepest node (the furthest node from the root).

Example:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 179 次阅读, 16640 次搜索 | 106 个单词

77 - 每日算法题: Buddy Strings - buddy-strings.txt

Hi, here's your problem today. This problem was recently asked by AirBNB:

Given two strings A and B of lowercase letters, return true if and only if we can swap two letters in A so that the result equals B.

Example 1:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 692 次阅读, 14724 次搜索 | 109 个单词

78 - 每日算法题: Trapping Rainwater - tapping-rainwater.txt

Hi, here's your problem today. This problem was recently asked by Uber:

You have a landscape, in which puddles can form. You are given an array of non-negative integers representing the elevation at each location. Return the amount of water that would accumulate if it rains.

For example: [0,1,0,2,1,0,1,3,2,1,2,1] should return 6 because 6 units of water can get trapped here.
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 386 次阅读, 14180 次搜索 | 85 个单词

79 - 每日算法题: Create a balanced binary search tree - create-a-balanced-binary-search-tree.txt

Hi, here's your problem today. This problem was recently asked by LinkedIn:

Given a sorted list of numbers, change it into a balanced binary search tree. You can assume there will be no duplicate numbers in the list.

Here's a starting point:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 173 次阅读, 15792 次搜索 | 111 个单词

80 - 每日算法题: Merge K Sorted Linked Lists - merge-k-sorted-linked-list.txt

Hi, here's your problem today. This problem was recently asked by Twitter:

You are given an array of k sorted singly linked lists. Merge the linked lists into a single sorted linked list and return it.

Here's your starting point:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 190 次阅读, 16955 次搜索 | 98 个单词


分类: 所有 | 乱七八糟(52) | 计算机科学(163) | 生活(35) | 成功(18) | 有意思(24) | 怀念(4) | 分享(60) | 情与爱(14) | 新闻资讯(84) | 名人名言(92) | 知识问答(26) | 健康(6) | 图片(5) | 故事(6) | 视频(13) | 虚拟货币-区块链(1) |
共: 163 - 统计 | 存档
« 前一页 ( 页数 : 1 2 3 4 5 6 7 8 9 10 .. ) 后一页 »


最后更新: May 11 2024 14:46:15 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />