leetcode
huangzhebin1992
android应用开发
展开
-
leetcode --Number of 1 Bits
int hammingWeight(uint32_t n) { int sum = 0; while(n != 0) { if (n%2 == 1) sum+=1; n=n/2; } return sum; }原创 2015-10-19 10:13:24 · 264 阅读 · 0 评论 -
leetcode 217--Contains Duplicate
Contains Duplicate My Submissions Question Solution Total Accepted: 41448 Total Submissions: 109844 Difficulty: Easy Given an array of integers, find if the array contains any d原创 2015-10-12 09:53:27 · 326 阅读 · 0 评论 -
leetcode --Contains Duplicate II
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and jis at most k. 注原创 2015-10-12 10:31:44 · 280 阅读 · 0 评论 -
leetcode 226--Invert Binary Tree
解题思路: 利用递归思想,由底向上进行翻转,当需要翻转的树的根节点为空时返回 /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ s原创 2015-10-08 19:48:12 · 318 阅读 · 0 评论 -
leetcode 104--Maximum Depth of Binary Tree
题目大意为计算二叉树的深度,根节点本身算作深度为1,可递归计算左右子树的深度,将两者中的较大者加上根节点的深度则为该树的深度 /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode原创 2015-10-09 09:30:10 · 240 阅读 · 0 评论 -
leetcode 283--Move Zeroes
void moveZeroes(int* nums, int numsSize) { int z = 0, count = 0; for(int i = 0; i { nums[i - count] = nums[i]; if (nums[i] == 0) { count += 1;原创 2015-10-09 09:47:31 · 244 阅读 · 0 评论 -
leetcode 100--Same Tree
Same Tree My Submissions Question Solution Total Accepted: 84900 Total Submissions: 203205 Difficulty: Easy Given two binary trees, write a function to check if they are equal o原创 2015-10-09 09:39:27 · 256 阅读 · 0 评论 -
leetcode 258--Add Digits
解题思路: 题目大意为给定一个数字,将其所有位数上的数字相加得到一个新的数字,如果得到的数字的位数仍大于一位,则继续将得到的数字的所有位数相加得到另一个数字,直到相加所得的数字只有一个数字则返回。 int addDigits(int num) { return 1 + (num-1) % 9; }原创 2015-10-09 09:17:29 · 256 阅读 · 0 评论 -
leetcode 237--Delete Node in a Linked List
Delete Node in a Linked List My Submissions Question Solution Total Accepted: 34422 Total Submissions: 77040 Difficulty: Easy Write a function to delete a node (except the tail)原创 2015-10-09 09:32:18 · 274 阅读 · 0 评论 -
leetcode -- Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority element原创 2015-10-20 16:02:45 · 313 阅读 · 0 评论 -
leetcode --Power of Two
题目:Given an integer, write a function to determine if it is a power of two. 给定一个整形数,判断是否为2的幂,一开始想到的解题思路为使用c语言自带的计算幂的函数,循环计算 #include bool isPowerOfTwo(int n) { int i = 0; while(n >= pow(原创 2015-10-19 11:34:40 · 282 阅读 · 0 评论 -
leetcode --Reverse Bits
Reverse bits of a given 32 bits unsigned integer. For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as0011100101原创 2015-10-19 10:34:27 · 213 阅读 · 0 评论 -
leetcode--Excel Sheet Column Number
Given a column title as appear in an Excel sheet, return its corresponding column number. For example: A -> 1 B -> 2 C -> 3 ... Z -> 26 AA -> 27 AB -> 28 public c原创 2015-10-19 16:24:45 · 283 阅读 · 0 评论 -
leetcode 292---NIM GAME
bool canWinNim(int n) { return n%4!=0; }原创 2015-10-14 11:11:37 · 271 阅读 · 0 评论