- 博客(56)
- 收藏
- 关注
RSS订阅转载 程序员如何留住健康？
相信大家已经注意到了，程序员的大部分时间都花在电脑桌前编程，这会损害程序员的健康。其实不需要多么复杂的养生，你只需每天做一些小小的改变，就可以摆脱病痛、保持健康。变换姿势虽然站立桌、昂贵的椅子和一些基于人体工程学的玩意的确很酷，哪怕LINUS（linux创始人）都在踏步机前工作，而事实上你并不需要这些。关键是要变换姿势，如果你保持一个姿势数个小时不活动，你的脖子在数天后疼痛是必然的。每
2016-02-23 19:52:00
762
转载 【PS3】二之国 白色圣灰的女王 日本制造的视觉效果
原文：http://www.element3ds.com/thread-29245-1-1.html二之国 白色圣灰的女王走向RPG的王道 日本制造的视觉效果本作用CG再现了吉卜力工作室的温暖世界观。作为把以前只能在电影作品中看到的世界积极运作的杰作，成为一个大话题。这次因为在Level5的开发组中打听到了本作中加入的思路，所以想介绍一下。TEXT_久代忠史翻译 T
2016-02-21 19:10:39
4670
2
转载 【lighting】Color and Vision
The Electromagnetic and Visible Spectra原文：http://www.physicsclassroom.com/class/light/Lesson-2/The-Electromagnetic-and-Visible-SpectraThe Electromagnetic and Visible SpectraVisible Light a
2016-02-19 20:28:47
4744
原创 面试笔试杂项积累-leetcode 331-335
至此2016-2-15，全部333道题除去锁题和不想做的= =。就都做完了。。。331.331-Verify Preorder Serialization of a Binary Tree-Difficulty: MediumOne way to serialize a binary tree is to use pre-order traversal. When we e
2016-02-15 23:07:55
1276
原创 面试笔试杂项积累-leetcode 326-330
326.326-Power of Three-Difficulty: EasyGiven an integer, write a function to determine if it is a power of three.Follow up:Could you do it without using any loop / recursion?思路像之前做是否是二次幂的那
2016-02-15 22:53:19
758
原创 面试笔试杂项积累-leetcode 321-325
322.322-Coin Change-Difficulty: MediumYou are given coins of different denominations and a total amount of moneyamount. Write a function to compute the fewest number of coins that you need to ma
2016-02-15 22:35:46
814
原创 面试笔试杂项积累-leetcode 311-320
318.318-Reconstruct Itinerary-Difficulty: MediumGiven a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case letters. I
2016-02-15 22:30:15
747
原创 面试笔试杂项积累-leetcode 306-310
306.306-Additive Number-Difficulty: MediumAdditive number is a string whose digits can form additive sequence.A valid additive sequence should contain at least three numbers. Except for the fi
2016-02-14 22:35:40
822
原创 面试笔试杂项积累-leetcode 301-305
303.303-Range Sum Query - Immutable-Difficulty: EasyGiven an integer array nums, find the sum of the elements between indicesi and j (i ≤ j), inclusive.Example:Given nums = [-2, 0, 3, -5,
2016-02-14 22:27:27
910
转载 腰间盘突出的自我治疗和锻炼方法
与腰间盘突出打交道十年了，此病害人不浅。加重时，卧立不安，不得以工作时，还要忍痛面对，要命的是年轻人若得此病，一切爱好如武术，篮球，网球，骑马等等就只得刀枪入库，放马南山。 一切从实际出发，一切要讲究科学。这十年抗战，经验由此得来。 庸医不分中西 当今有不少言论谈及中西医，东说中医有效，西说西医无敌。暂且不表立场，谁有效则可试之。本人的经验得之，西医的图像成像技术，省去了中医
2016-02-14 20:37:37
2918
9
转载 腰椎间盘突出&腰椎间盘膨出的锻炼方法
腰间盘突出在现代社会是比较常见的一种病变，尤其是在一些办公室工作的朋友，整日坐在电脑桌前，容易出现这个问题，在这里给大家分享一些腰间盘突出的简单的锻炼方法。步骤/方法最简单实用的一个锻炼方法就是每天倒走半个到一个小时。这是从一位腰椎动过手术的朋友那里听来的，他试了大概一个月，说是效果还可以，在倒走的时候，一定要注意身后是否有危险，尽量选择平坦的小路锻
2016-02-13 23:26:05
18447
1
原创 面试笔试杂项积累-leetcode 291-300
292.292-Nim Game-Difficulty: EasyYou are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one w
2016-02-13 23:22:34
706
原创 面试笔试杂项积累-leetcode 286-290
289.289-Game of Life-Difficulty: MediumAccording to the Wikipedia's article: "The Game of Life, also known simply asLife, is a cellular automaton devised by the British mathematician John Ho
2016-02-13 23:14:22
738
原创 面试笔试杂项积累-leetcode 281-285
283.283-Move Zeroes-Difficulty: EasyGiven an array nums, write a function to move all0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums
2016-02-13 23:07:46
595
原创 面试笔试杂项积累-leetcode 271-280
273.273-Integer to English Words-Difficulty: MediumConvert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1.For example,123 -> "O
2016-02-13 23:03:49
703
原创 面试笔试杂项积累-leetcode 261-270
263.263-Ugly Number-Difficulty: EasyWrite a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include2, 3, 5. For example, 6,
2016-02-13 22:44:10
661
原创 面试笔试杂项积累-leetcode 246-260
257.257-Binary Tree Paths-Difficulty: EasyGiven a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths ar
2016-02-13 22:26:39
727
4
转载 分治算法 Divide and Conquer Algorithm
分而治之,指的是分治算法.分治算法是基于多分枝递归的一种算法设计模式.分治算法递归地把一个大问题分解为多个类型相同的子问题,直到这些子问题足够的简单能被直接解决.最后把这些子问题的解结合起来就能得到原始问题的解.原文：http://www.cnblogs.com/Gavin_Liu/archive/2011/04/15/2015469.html先看一段来自wikipedia的定义：
2016-02-13 07:42:59
866
原创 面试笔试杂项积累-leetcode 241-245
242.242-Valid Anagram-Difficulty: EasyGiven two strings s and t, write a function to determine ift is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t =
2016-02-12 22:30:35
611
原创 面试笔试杂项积累-leetcode 236-240
236.236-Lowest Common Ancestor of a Binary Tree-Difficulty: MediumGiven a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA o
2016-02-12 22:27:00
566
1
原创 面试笔试杂项积累-leetcode 231-235
231.231-Power of Two-Difficulty: EasyGiven an integer, write a function to determine if it is a power of two.方法一思路判断一个数是否是2的幂除和取余，循环public class Solution { public bool IsPowerOfTwo
2016-02-12 22:00:50
575
原创 面试笔试杂项积累-leetcode 226-230
226.226- Implement Stack using Queues-Difficulty: EasyInvert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1Trivia:This p
2016-02-12 21:39:45
606
原创 面试笔试杂项积累-leetcode 221-225
221.221-Combination Sum III-Difficulty: MediumGiven a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.For example, given the following ma
2016-02-11 23:24:45
692
原创 面试笔试杂项积累-leetcode 216-220
216.216-Combination Sum III-Difficulty: MediumFind all possible combinations of k numbers that add up to a numbern, given that only numbers from 1 to 9 can be used and each combination should
2016-02-11 23:21:33
630
原创 面试笔试杂项积累-leetcode 211-215
211.211-Add and Search Word - Data structure design-Difficulty: MediumDesign a data structure that supports the following two operations:void addWord(word)bool search(word)search(word) can s
2016-02-11 22:49:52
725
转载 快速选择SELECT算法的深入分析与实现
leetcode 215Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For example,Given [3,2,1,5,6,4] a
2016-02-11 17:22:51
8949
1
原创 面试笔试杂项积累-leetcode 206-210
206.206-Reverse Linked List-Difficulty: EasyReverse a singly linked list.方法一思路把链表反过来第一种方法，改值，全存到list中，反过来赋值，比较差的方法/** * Definition for singly-linked list. * public class ListNode {
2016-02-10 11:37:40
414
转载 Trie（数字树、字典树、前缀树）
原文：http://www.cnblogs.com/huangxincheng/archive/2012/11/25/2788268.htmlTrie树的名字有很多，比如字典树，前缀树等等。一：概念 下面我们有and,as,at,cn,com这些关键词，那么如何构建trie树呢？从上面的图中，我们或多或少的可以发现一些好玩的特性。 第一：根节点不包含字符，
2016-02-10 10:18:28
2569
原创 面试笔试杂项积累-leetcode 201-205
202.202-Happy Number-Difficulty: EasyWrite an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, repla
2016-02-09 22:12:16
622
原创 面试笔试杂项积累-leetcode 191-200
191.191-Number of 1 Bits-Difficulty: EasyWrite a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as theHamming weight).For example, the 32-bit int
2016-02-08 22:57:26
486
原创 面试笔试杂项积累-leetcode 179-190
189.189-Rotate Array-Difficulty: EasyRotate an array of n elements to the right byk steps.For example, with n = 7 and k = 3, the array[1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4]. Note:
2016-02-08 22:53:58
499
原创 面试笔试杂项积累-leetcode 171-175
171.171-Excel Sheet Column Number-Difficulty: EasyRelated to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For exa
2016-02-08 22:38:11
416
原创 面试笔试杂项积累-leetcode 166-170
168.168-Excel Sheet Column Title-Difficulty: EasyGiven a positive integer, return its corresponding column title as appear in an Excel sheet.For example: 1 -> A 2 -> B 3 -> C ..
2016-02-08 22:25:41
383
原创 面试笔试杂项积累-leetcode 161-165
162.162-Find Peak Element-Difficulty: MediumA peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and return its index
2016-02-08 00:56:42
472
原创 面试笔试杂项积累-leetcode 156-160
160.160-Intersection of Two Linked Lists-Difficulty: EasyWrite a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked li
2016-02-08 00:51:22
587
原创 面试笔试杂项积累-leetcode 151-155
151.151-Linked List Cycle-Difficulty: MediumGiven an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".Update (2015-02-12):Fo
2016-02-08 00:47:37
475
原创 面试笔试杂项积累-leetcode 146-150
除夕做的题，贴春联，做饭的时间占用了，，做了十道题，总结之146.146-LRU Cache-Difficulty: HardDesign and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:get and s
2016-02-08 00:25:31
560
原创 面试笔试杂项积累-leetcode 141-145
141.141-Linked List Cycle-Difficulty: MediumGiven a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?思路判断是否为循环链表一个快指针跳两次，一个慢指针走一次，如果是循环
2016-02-06 00:15:58
659
原创 面试笔试杂项积累-leetcode 136-140
136.136-Single Number-Difficulty: MediumGiven an array of integers, every element appearstwice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexit
2016-02-06 00:12:29
398
原创 面试笔试杂项积累-leetcode 131-135
131.131-Palindrome Partitioning-Difficulty: MediumGiven a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s = "aab",Return [ ["aa","b"],
2016-02-06 00:06:41
420
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人