议题一玩到
码龄12年
关注
提问 私信
  • 博客:102,702
    102,702
    总访问量
  • 107
    原创
  • 1,181,095
    排名
  • 3
    粉丝
  • 0
    铁粉

个人简介:硅谷码农

IP属地以运营商信息为准,境内显示到省(区、市),境外显示到国家(地区)
IP 属地:美国
  • 加入CSDN时间: 2012-10-23
博客简介:

ChiBaoNeLiuLiuNi的专栏

查看详细资料
个人成就
  • 获得4次点赞
  • 内容获得4次评论
  • 获得5次收藏
创作历程
  • 1篇
    2023年
  • 2篇
    2019年
  • 1篇
    2018年
  • 16篇
    2017年
  • 5篇
    2016年
  • 88篇
    2015年
  • 8篇
    2014年
成就勋章
TA的专栏
  • 面试准备
    24篇
  • LeetCode
    92篇
  • LintCOde
  • 面经
    6篇
  • 笔记
    3篇
  • 日记
    1篇
  • System Design
    4篇
  • Behavior Question
    1篇
  • 公司列表
    1篇
  • OOD
    1篇
  • EPI
    1篇
  • Hive
兴趣领域 设置
  • 大数据
    flink
  • 人工智能
    opencv计算机视觉机器学习深度学习神经网络图像处理数据分析
创作活动更多

仓颉编程语言体验有奖征文

仓颉编程语言官网已上线,提供版本下载、在线运行、文档体验等功能。为鼓励更多开发者探索仓颉编程语言,现诚邀各位开发者通过官网在线体验/下载使用,参与仓颉体验有奖征文活动。

368人参与 去创作
  • 最近
  • 文章
  • 代码仓
  • 资源
  • 问答
  • 帖子
  • 视频
  • 课程
  • 关注/订阅/互动
  • 收藏
搜TA的内容
搜索 取消

#leetcode 56 Merge Intervals

【代码】#leetcode 56 Merge Intervals。
原创
发布博客 2023.10.05 ·
350 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

#note#Cracking the coding interview

Big O analysis of recursion:  Try to remember this pattern. When you have a recursive function that makes multiple calls, the runtime will often (but not always) look like O(branche's depth), wher...
原创
发布博客 2019.01.09 ·
243 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

#work note# consistant hashing

需要做一个 account bucket,1% ~ 10% 与 10% ~ 20% 是不同的,实现方法就是 对 account_id hash,然后 mod 100, 取余数,即此 account_id 对应的 account_bucket 最开始我的实现是,sha256(account_id)  --> 转换成 string  --> 获取string的hashCode(...
原创
发布博客 2019.01.09 ·
283 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

#leetcode# Plus One

Given a non-empty array of digits representing a non-negative integer, plus one to the integer.The digits are stored such that the most significant digit is at the head of the list, and each element...
原创
发布博客 2018.12.26 ·
240 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

Python学习笔记

工作需要熟悉一下Python, 在看Learn Python the hard way, 记点笔记-------------------------------------------------------------------------------------------------------- What is the difference between %r and %s?
原创
发布博客 2017.12.11 ·
372 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

#leetcoce#277. Find the Celebrity

Suppose you are at a party withnpeople (labeled from0ton - 1) and among them, there may exist one celebrity. The definition of a celebrity is that all the othern - 1people know him/her but
原创
发布博客 2017.09.18 ·
565 阅读 ·
0 点赞 ·
1 评论 ·
0 收藏

#leetcode#647. Palindromic Substrings

https://leetcode.com/problems/palindromic-substrings/description/Given a string, your task is to count how many palindromic substrings in this string.The substrings with different start indexes
原创
发布博客 2017.09.18 ·
919 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

#leetcode#130. Surrounded Regions

iven a 2D board containing'X'and'O'(theletterO), capture all regions surrounded by'X'.A region is captured by flipping all'O's into'X's in that surrounded region.For example,X X X
原创
发布博客 2017.08.21 ·
398 阅读 ·
0 点赞 ·
1 评论 ·
0 收藏

#leetcode#38. Count and Say

The count-and-say sequence is the sequence of integers with the first five terms as following:1. 12. 113. 214. 12115. 1112211 is read off as "one 1" or 11.11 is read o
原创
发布博客 2017.06.14 ·
487 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

#leetcode#547. Friend Circles

There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct friend of B, and B is a direct friend of C, the
原创
发布博客 2017.06.14 ·
557 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

#leetcode#500 Keyboard Row

Given a List of words, return the words that can be typed using letters of alphabet on only one row's of American keyboard like the image below.Example 1:Input: ["Hello", "Alaska", "Da
原创
发布博客 2017.06.11 ·
346 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

#leetcode#Ugly Numbers 2

Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first
原创
发布博客 2017.06.10 ·
354 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

#leetcode#305. Number of Islands II

A 2d grid map of m rows andn columns is initially filled with water. We may perform anaddLand operation which turns the water at position (row, col) into a land. Given a list of positions to opera
原创
发布博客 2017.06.02 ·
679 阅读 ·
0 点赞 ·
0 评论 ·
1 收藏

#leetcode#220. Contains Duplicate III

Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i] and nums[j] is at most t and the absolute diffe
原创
发布博客 2017.05.26 ·
421 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

#leetcode#179. Largest Number

Given a list of non negative integers, arrange them such that they form the largest number.For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330.Note: The result may be ve
原创
发布博客 2017.05.23 ·
353 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

#leetcode#329. Longest Increasing Path in a Matrix

Given an integer matrix, find the length of the longest increasing path.From each cell, you can either move to four directions: left, right, up or down. You may NOT move diagonally or move outside
原创
发布博客 2017.05.08 ·
539 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

#leetcode#202. Happy Number

https://leetcode.com/problems/happy-number/Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive inte
原创
发布博客 2017.02.20 ·
330 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

#leetcode#515. Find Largest Element in Each Row

515. Find Largest Element in Each RowMy SubmissionsBack To ContestUser Accepted: 851 User Tried: 878 Total Accepted: 943 Total Submissions: 2140 Difficulty: MediumY
原创
发布博客 2017.02.13 ·
543 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

#leetcode#513. Find Left Most Element My SubmissionsBack To Contest

513. Find Left Most ElementMy SubmissionsBack To ContestUser Accepted: 870 User Tried: 943 Total Accepted: 882 Total Submissions: 2399Difficulty: MediumGiven a bina
原创
发布博客 2017.02.13 ·
408 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

#leetcode# Base 7

504. Base 7My SubmissionsBack To ContestGiven an integer, return its base 7 string representation.Example 1:Input: 100Output: "202"Example 2:Input: -7Outpu
原创
发布博客 2017.02.13 ·
683 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏
加载更多