- 博客(11)
- 收藏
- 关注
原创 MacBook Pro电池0%,接上电源却显示电池没有正在充电的解决方案
博主的MBP刚买完就出现了充不进去电的情况,差点没吓个半死,总结了网上的解决方案后解决了问题,为了防止下次出现类似问题,先记录下来:将电源适配器连接到电源和MBP。在内建键盘上,同时按下左侧Shift+Control+Option键和电源按钮同时松开所有键和电源按钮打开电脑就发现问题解决了,谢天谢地啊~~
2017-08-26 11:03:56 69302 9
原创 LeetCode 92. Reverse Linked List II
Description: Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4, return 1->4->3->2->5->NULL. Note: Given
2017-08-11 21:22:39 268
原创 LeetCode 8. String to Integer (atoi)
Description: Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the po
2017-08-11 14:15:19 404
原创 LeetCode 7. Reverse Integer
Description: Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 Have you thought about this? Here are some good questions to ask before coding. B
2017-08-07 22:37:29 306
原创 LeetCode 6. ZigZag Conversion
Description: The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H N
2017-08-07 20:56:17 224
原创 LeetCode 3. Longest Substring Without Repeating Characters
Description: Given a string, find the length of the longest substring without repeating characters. For example: Given “pwwkew”, the answer is “wke”, with the length of 3. Note that the answ
2017-08-07 19:11:14 297
原创 LeetCode 214. Shortest Palindrome
Description: Given a string S, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can find by performing this transformati
2017-08-07 18:44:23 424
原创 针对mac系统下安装ipython时出现的OSError的解决方案
这几天学Python时,被人推荐去下载ipython,于是参考了网上得到如下方法:$ sudo pip install ipython --upgrade --ignore-installed six本人Mac系统为Sierra,多次尝试后总是出现这样的错误:OSError: [Errno 1] Operation not permitted: '/System/Library/Framework
2017-08-01 00:38:30 1395
原创 上机作业之树:二叉树遍历算法、由遍历序列构造二叉树算法
题目: 1. 定义二叉树类,封装构造二叉树基本操作,广度优先遍历,深度优先遍历(递归和非递归算法)等。 2. 实现由先序、中序序列构造二叉树的算法。 3. 实现由后序、中序序列构造二叉树的算法。//
2016-11-13 18:50:48 1322
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人