LeetCode
Young-zhou
这个作者很懒,什么都没留下…
展开
-
657. Judge Route Circle(字符串转换成字符比较问题)
Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the original place. The move sequence is represented by原创 2017-08-19 11:16:40 · 271 阅读 · 0 评论 -
461. Hamming Distance(转换成二进制比较)
The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calculate the Hamming distance.Note: 0 ≤ x, y < 231.Examp原创 2017-08-19 13:38:01 · 349 阅读 · 0 评论 -
617. Merge Two Binary Trees(二叉树的合并)
Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not. You need to merge them into a new binary tr原创 2017-08-21 09:01:49 · 280 阅读 · 0 评论