- 博客(5)
- 资源 (3)
- 收藏
- 关注
原创 LeetCode485. Max Consecutive Ones有你真好
Given a binary array, find the maximum number of consecutive 1s in this array.Example 1:Input: [1,1,0,1,1,1]Output: 3Explanation: The first two digits or the last three digits are consecutiv
2017-01-19 20:40:37 503
原创 LeetCode476. Number Complement位操作面试题
Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.Note:The given integer is guaranteed to fit within the range
2017-01-14 23:42:26 465
原创 LeetCode453. Minimum Moves to Equal Array Elements我是这么解答的
Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.Example:Input:[1,2,3]Ou
2017-01-08 23:32:52 313
原创 C#编程命名规范
这盛世,如你所愿。每当看到一些混蛋的官员言论,内心挺愤怒的,即痛恨这种混蛋,也痛恨自己无能为力。命名约定:在.NET Framework名称空间中有两种命名约定,称为PascalCase和camelCase在camelCase中,有一个规则,如果多个单词命名变量名,从第二个单词开始,每个单词首字母大写命名规则:命名空间、类、常量等的名称都遵循Pascal规则!
2017-01-08 23:06:31 361
原创 LeetCode448. Find All Numbers Disappeared in an Array新年第一篇
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements of [1, n] inclusive that do not appear in this array.
2017-01-01 11:00:55 332
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人