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

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

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

问：还可以收发信息吗?
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 微信, 拉黑, 删除, 区别, Wechat, Block, | 中文 | 88883 Views, 26411 Search Bots | 356 Characters

162 - 你见过哪些员工因为作死被开除的事情？ - getting-fired.txt.txt

匿名用户：

老爹以前是某央企下的食用油生产基地的董事长，有天回来跟我说，他们的配电室被人扔了一颗炸弹。。。。。这个配电室可不是办公室的配电室，而是仓库的配电室，旁边全部都是油罐，如果发生了连环爆炸，后果将不堪设想。幸亏炸弹是有人自己用易拉罐制造的，威力不大才没有出大问题，只是暂时断了电。事发后配合警方各种追查，摄像头遭到破坏，不过通过绑易拉罐炸弹的透明胶带上的指纹，把目标锁定在了公司的某个刚入职半年的员工身上。小哥是工厂的加工员，刚入职半年。提审他的时候，他供认不讳。他表示他刚入职半年，从学校出来比较懒散，不适应公司的工作节奏。于是他做了个自制炸弹，趁没人的时候扔到配电箱里，想着只要公司发生了事故，他就能放假休息几天了。

匿名用户：
...
Full Text>>

Top | Category: Others | Comments (0) | Tags: 被开除, 作死, Get Fired, Stories, | 中文 | 92237 Views, 25719 Search Bots | 2309 Characters

163 - 网易被裁员工已和网易达成和解 - netease-says-sorry.txt.txt

11月29日下午消息，网易与前员工纠纷事件又有最新进展，网易发布公告再次致歉，并表示双方已经达成和解，强调此次事件是对公司的重大警醒，将从严处分各环节责任人。

　　同时，网易被裁员工也对事件进行了回应，他表示，非常感谢所有公众和媒体对他的事给予了巨大的关注与支持。这几天，网易高层几次联系他，当面做了很诚恳的道歉、沟通和慰问。目前，他和网易已经达成了和解：双方一致同意，放下争议，共同去关注眼下最重要的事情。

网易裁员
...
Full Text>>

Top | Category: News | Comments (0) | Tags: 网易, 裁员, 和解, Netease, 163, | 中文 | 84992 Views, 26868 Search Bots | 581 Characters

164 - Daily Interview Problem: 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:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | 75719 Views, 62344 Search Bots | 81 Words

165 - Daily Interview Problem: 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:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | 65222 Views, 25318 Search Bots | 128 Words

166 - Daily Interview Problem: 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.
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | 78696 Views, 34963 Search Bots | 89 Words

167 - Daily Interview Problem: 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.
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | 77201 Views, 25430 Search Bots | 77 Words

168 - Daily Interview Problem: 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:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | 79221 Views, 36105 Search Bots | 106 Words