- 博客(11)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 LeetCode 338. Counting Bits C语言
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 yo
2016-04-28 20:58:51
706
原创 LeetCode 171. Excel Sheet Column Number C语言
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 这一体是其他进制转换为进
2016-04-24 21:19:56
367
原创 LeetCode 242. Valid Anagram C语言
Given two strings s and t, write a function to determine if t is an anagram of s. For example, s = "anagram", t = "nagaram", return true. s = "rat", t = "car", return false. 首先是要两个字符串的长度想等； 然
2016-04-24 21:00:44
498
原创 LeetCode 100. Same Tree C语言
Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value. 树的问题最容易想到的
2016-04-24 20:55:51
762
原创 LeetCode 237. Delete Node in a Linked List C语言
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value
2016-04-24 20:44:17
417
原创 LeetCode 283. Move Zeroes C语言
Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. For example, given nums = [0, 1, 0, 3, 12], after calling your
2016-04-24 20:33:42
288
原创 LeetCode 226. Invert Binary Tree C语言
树大都用了递归的思想，这到题也是； 一颗只有根节点和叶子的二叉树，转置它是左右子树交换； 左右子树转置又是这样，这样就是自己调用自己了； 然后还要有递归的出口，当没有儿子的时候或者根节点为空时，返回自己，这个就是出口； /** * Definition for a binary tree node. * struct TreeNode { * int val; *
2016-04-24 20:16:28
537
原创 LeetCode 104. Maximum Depth of Binary Tree C语言
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-04-24 20:05:58
447
原创 LeetCode 258. Add Digits C语言
最朴素的方法，也是可以AC 的方法是循环，但是不符合题目要求 int addDigits(int num) { return (num-1)%9+1; } 时间复杂度是O(1)，我们应该最先想到找规律。 １ ２ ３ ４ ５ ６ ７ ８ ９ １０ １１ １２ １３ １４ １５ １ ２ ３ ４ ５ ６ ７ ８ ９ １ ２ ３ ４ ５ ６ 答案为１－９中的一个，且循
2016-04-24 19:50:50
399
原创 LeetCode 292. Nim Game C语言
这到题代码很简单，要讲清楚不容易，最简单的是找规律，但是这还没讲出它的道理，等你们解释给我听。bool canWinNim(int n) { if(n%4==0) return 0; else return 1; }
2016-04-24 19:44:14
320
原创 LeetCode 344. Reverse String C语言
这道题很简单，前后两个“指针”，一个前移，一个后移。 ``` char* reverseString(char* s) { int i=0,j=strlen(s)-1; char t; while(i { t=s[i]; s[i]=s[j]; s[j]=t; i++;
2016-04-24 19:31:54
911
无锁化编程
2018-07-11
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人