- 博客(7)
- 收藏
- 关注
RSS订阅原创 LeetCode 88 Merge Sorted Array
原题： Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: You may assume that nums1 has enough space (size that is greater or equal to m + n) to
2018-01-15 18:03:16
103
原创 LeetCode 86 Partition List
原题： Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nodes in
2018-01-15 17:42:32
96
原创 LeetCode 66 Plus One
原题： Given a non-negative integer represented as a non-empty array of digits, plus one to the integer. You may assume the integer do not contain any leading zero, except the number 0 itself. T
2018-01-15 14:15:50
112
原创 LeetCode 70. Climbing Stairs
原题： You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Note: Given n wil
2018-01-14 17:34:20
107
原创 高性能MySQL第一章笔记
1.MYSQL服务器逻辑架构图每个客户端连接都会在服务器中拥有一个线程。2.并发控制（1）处理并发读写时，可以通过实现由两种类型的锁组合的锁系统来完成，一般称为共享锁和排它锁，也被称为读锁和写锁。读锁是共享的，不影响其他人的读或写，写锁则会阻塞其它的读锁或写锁。锁粒度：最理想的方式是只锁定需要修改的部分数据。锁策略：大量锁会造成系统开销，在开销和安全之间寻找平衡，就是所谓锁策略。每种MYSQL引擎...
2018-01-12 20:27:47
315
原创 LeetCode 7&9 Reverse Integer & Palindrome Number
这两题都很简单，就是反转数字，基本代码是一样的，只是回文最后需要判断一下，直接上代码 第七题 class Solution { public int reverse(int x) { long res = 0; while(x != 0){ res = res*10 + x%10; x = x/10;
2018-01-10 01:30:20
107
原创 LeetCode 2 Add Two Numbers
原题： You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and
2018-01-10 01:09:09
105
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人