發(fā)簡信
IP屬地：華盛頓州
-
2018愛奇藝Java開發(fā)實習(xí)生面筋總共15道選擇題冻押，3道編程題驰贷。我感覺選擇題是比較難的。 這是第二道編程題.我的解法如下(AC)：
-
2018京東Java開發(fā)實習(xí)生一面
面試官是無人店組的洛巢，說實話我還挺喜歡的括袒。但是估計涼了。 兩分鐘自我介紹問了mvc觀察者模式是怎樣的如何通知observers稿茉，它的uml圖的關(guān)系...
-
LeetCode323. Number of Connected Components in an Undirected Graph
Given n nodes labeled from 0 to n - 1 and a list of undirected edges (ea...
-
LeetCode547. Friend Circles
There are N students in a class. Some of them are friends, while some ar...
-
美圖2018安卓開發(fā)實習(xí)生筆試題（回憶）
選擇和填空題 考察知識點： Java的copy by reference Java的線程安全相關(guān)知識 Java的try catch final知...
-
LeetCode439. Ternary Expression Parser
Given a string representing arbitrarily nested ternary expressions, calc...
-
LeetCode104.Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth. The maximum depth is the nu...
-
Leetcode112.Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf ...
-
110.Balanced Binary Tree
Given a binary tree, determine if it is height-balanced. For this proble...