LeetCode
文章平均质量分 51
DennisDing0201
UE4小彩笔一枚。U3D也不太精通,写博客帮助记忆么么哒
展开
-
LeetCode 371. Sum of Two Integers
用位操作实现两个整型相加,不允许用加号整型相加主要分为两部分.一部分是相加操作,一部分是进位操作.比如2+3;就是010+011先通过异或运算算出相加的部分010^011 = 001再通过&和010&011 = 010010容易知道001+100的结果其实就是101,也就是5,但是由于这里不让用+操作..所以我们还要递归调用一次.直到没有移位操作的时候,才能结束程序..原创 2016-11-22 20:47:27 · 237 阅读 · 0 评论 -
Leet Code 455. Assign Cookies
Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum size of a c原创 2016-11-23 20:39:06 · 315 阅读 · 0 评论 -
Leet Code 104. Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.很简单的一个深度优先搜索的代码...就是找到一颗二叉树的原创 2016-11-23 21:05:29 · 304 阅读 · 0 评论 -
LeetCode 419. Battleships in a Board
Given an 2D board, count how many different battleships are in it. The battleships are represented with 'X's, empty slots are represented with '.'s. You may assume the following rules:You receiv原创 2017-01-03 17:19:48 · 400 阅读 · 0 评论 -
LeetCode 338. Counting Bits
Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array.Example:For num = 5原创 2017-01-04 16:24:28 · 365 阅读 · 0 评论