Profile cover photo
Profile photo
Xinghua Li
86 followers
86 followers
About
Posts

Welcome leetcoders!

Post has attachment

Post has attachment
Binary Tree Inorder Traversal (Java)
Given a binary tree, return the  inorder  traversal of its nodes' values. For example: Given binary tree  {1,#,2,3} , 1
\
2
/
3 return  [1,3,2] . Note:  Recursive solution is trivial, could you do it iteratively?

Post has shared content
Xiaomi Mi 4 First Sale in China: Sold Out in 37 Seconds!
More: http://en.miui.com/thread-30730-1-1.html
- Stainless steel frame, unbelievable craftsmanship & polish
- Snapdragon 801 chipset, 3GB RAM, 16/64GB Flash
- 5-inch 1080p IPS display, very high color gamut (84% of NTSC range)
- 13MP rear camera, f1.8, real-time HDR, 4K video recording (Sony IMX214)
- 8MP front camera, f1.8, 80-degree wide angle (Sony IMX219)
- 3080mAh internal battery, quick charging at 9V/1.2A or 5V/2A
- Swappable back plate
- Weight: 149g
- RMB 1999 (~$320) for 16GB Version; RMB 2499 (~$400) for 64GB Version
So, do you want Mi 4 to be sold in your country?
Photo

Post has attachment

Post has attachment

Post has attachment
Best Time to Buy and Sell Stock II
Say you have an array for which the  i th  element is the price of a given stock on day  i . Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). Howe...

Post has attachment

Post has attachment
Generate Parentheses (Java)
Given  n  pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given  n  = 3, a solution set is: "((()))", "(()())", "(())()", "()(())", "()()()" Solution: Greedy and Recursive Take advantage of the fe...

Post has attachment
Wait while more posts are being loaded