上一页 1 ··· 3 4 5 6 7 8 下一页
2015年1月18日
【Unity3D】计算二维向量夹角（-180到180）
摘要： 在Unity3D中，有时候我们需要计算二维向量的夹角。二维向量夹角一般在0~180度之前，可以直接调用Vector2.Angle(Vector2 from, Vector2 to)来计算。但是在有些场景，我们需要-180~180度的夹角，此时可以用下面的脚本进行计算：1 float Vect... 阅读全文
posted @ 2015-01-18 18:40 H5开发技术 阅读(14137) 评论(0) 推荐(0)
【leetcode】Partition List
摘要： Partition ListGiven a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should pres... 阅读全文
posted @ 2015-01-18 18:34 H5开发技术 阅读(246) 评论(0) 推荐(0)
【leetcode】Binary Tree Zigzag Level Order Traversal
摘要： Binary Tree Zigzag Level Order TraversalGiven a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then... 阅读全文
posted @ 2015-01-18 16:58 H5开发技术 阅读(166) 评论(0) 推荐(0)
2015年1月17日
【leetcode】Word Break II
摘要： Word Break IIGiven a stringsand a dictionary of wordsdict, add spaces insto construct a sentence where each word is a valid dictionary word.Return all... 阅读全文
posted @ 2015-01-17 21:28 H5开发技术 阅读(191) 评论(0) 推荐(0)
2015年1月16日
【leetcode】Substring with Concatenation of All Words
摘要： Substring with Concatenation of All WordsYou are given a string,S, and a list of words,L, that are all of the same length. Find all starting indices o... 阅读全文
posted @ 2015-01-16 22:59 H5开发技术 阅读(229) 评论(0) 推荐(0)
【Unity3D】使用鼠标键盘控制Camera视角（即时战略类游戏视角）：缩近，拉远，旋转
摘要： 今天写一个demo，要用到鼠标键盘控制三维视角，因此写了个脚本用于控制。该脚本可以用于即时战略类游戏的视角，提供了缩进，拉伸，旋转。同时按住鼠标右键不放，移动鼠标可以实现第一人称视角的效果。 1 using UnityEngine; 2 using System.Collections; 3 4 ... 阅读全文
posted @ 2015-01-16 20:43 H5开发技术 阅读(15925) 评论(0) 推荐(0)
2015年1月15日
【leetcode】Recover Binary Search Tree
摘要： Recover Binary Search TreeTwo elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A sol... 阅读全文
posted @ 2015-01-15 22:57 H5开发技术 阅读(226) 评论(0) 推荐(0)
【leetcode】Dungeon Game
摘要： Dungeon GameThe demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms l... 阅读全文
posted @ 2015-01-15 22:06 H5开发技术 阅读(217) 评论(0) 推荐(0)
2015年1月14日
【leetcode】Text Justification
摘要： Text JustificationGiven an array of words and a lengthL, format the text such that each line has exactlyLcharacters and is fully (left and right) just... 阅读全文
posted @ 2015-01-14 22:44 H5开发技术 阅读(271) 评论(0) 推荐(0)
2015年1月13日
【leetcode】Largest Number
摘要： Largest NumberGiven a list of non negative integers, arrange them such that they form the largest number.For example, given[3, 30, 34, 5, 9], the larg... 阅读全文
posted @ 2015-01-13 21:05 H5开发技术 阅读(343) 评论(0) 推荐(0)
2015年1月12日
【leetcode】Merge k Sorted Lists
摘要： Merge k Sorted ListsMergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.采用优先队列priority_queue把ListNode放入优先队... 阅读全文
posted @ 2015-01-12 23:03 H5开发技术 阅读(140) 评论(0) 推荐(0)
【leetcode】Reverse Nodes in k-Group
摘要： Reverse Nodes in k-GroupGiven a linked list, reverse the nodes of a linked listkat a time and return its modified list.If the number of nodes is not a... 阅读全文
posted @ 2015-01-12 21:32 H5开发技术 阅读(172) 评论(0) 推荐(0)
2015年1月11日
【leetcode】Multiply Strings
摘要： Multiply StringsGiven two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large ... 阅读全文
posted @ 2015-01-11 20:33 H5开发技术 阅读(174) 评论(0) 推荐(0)
【leetcode】Unique Binary Search Trees II
摘要： Unique Binary Search Trees IIGivenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,Givenn= 3, your pr... 阅读全文
posted @ 2015-01-11 14:28 H5开发技术 阅读(205) 评论(0) 推荐(0)
【leetcode】Convert Sorted List to Binary Search Tree
摘要： Convert Sorted List to Binary Search TreeGiven a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.... 阅读全文
posted @ 2015-01-11 13:39 H5开发技术 阅读(180) 评论(0) 推荐(0)
【leetcode】Convert Sorted Array to Binary Search Tree
摘要： Convert Sorted Array to Binary Search TreeGiven an array where elements are sorted in ascending order, convert it to a height balanced BST.每次把中间元素当成根节... 阅读全文
posted @ 2015-01-11 11:17 H5开发技术 阅读(176) 评论(0) 推荐(0)
2015年1月10日
【leetcode】Wildcard Matching
摘要： Wildcard MatchingImplement wildcard pattern matching with support for'?'and'*'.'?' Matches any single character.'*' Matches any sequence of characters... 阅读全文
posted @ 2015-01-10 21:41 H5开发技术 阅读(186) 评论(0) 推荐(0)
【leetcode】Permutations II
摘要： Permutations IIGiven a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2]have the follow... 阅读全文
posted @ 2015-01-10 16:49 H5开发技术 阅读(138) 评论(0) 推荐(0)
2015年1月9日
【leetcode】Next Permutation
摘要： Next PermutationImplement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangemen... 阅读全文
posted @ 2015-01-09 21:31 H5开发技术 阅读(201) 评论(0) 推荐(0)
【leetcode】Rotate Image
摘要： Rotate ImageYou are given annxn2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?假设旋转的时候... 阅读全文
posted @ 2015-01-09 20:20 H5开发技术 阅读(158) 评论(0) 推荐(0)
【leetcode】N-Queens II
摘要： N-Queens IIFollow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions. 1 class Solutio... 阅读全文
posted @ 2015-01-09 18:37 H5开发技术 阅读(137) 评论(0) 推荐(0)
【leetcode】N-Queens
摘要： N-QueensThen-queens puzzle is the problem of placingnqueens on ann×nchessboard such that no two queens attack each other.Given an integern, return all... 阅读全文
posted @ 2015-01-09 18:30 H5开发技术 阅读(198) 评论(0) 推荐(0)
【leetcode】Insert Interval
摘要： Insert IntervalGiven a set ofnon-overlappingintervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals... 阅读全文
posted @ 2015-01-09 16:30 H5开发技术 阅读(168) 评论(0) 推荐(0)
2015年1月8日
【leetcode】Spiral Matrix II
摘要： Spiral Matrix IIGiven an integern, generate a square matrix filled with elements from 1 ton2in spiral order.For example,Givenn=3,You should return the... 阅读全文
posted @ 2015-01-08 20:25 H5开发技术 阅读(132) 评论(0) 推荐(0)
2015年1月7日
【leetcode】Spiral Matrix
摘要： Spiral MatrixGiven a matrix ofmxnelements (mrows,ncolumns), return all elements of the matrix in spiral order.For example,Given the following matrix:[... 阅读全文
posted @ 2015-01-07 23:29 H5开发技术 阅读(197) 评论(0) 推荐(0)
【leetcode】Merge Intervals
摘要： Merge IntervalsGiven a collection of intervals, merge all overlapping intervals.For example,Given[1,3],[2,6],[8,10],[15,18],return[1,6],[8,10],[15,18]... 阅读全文
posted @ 2015-01-07 21:56 H5开发技术 阅读(175) 评论(0) 推荐(0)
【leetcode】Regular Expression Matching
摘要： Regular Expression MatchingImplement regular expression matching with support for'.'and'*'.'.' Matches any single character.'*' Matches zero or more o... 阅读全文
posted @ 2015-01-07 21:18 H5开发技术 阅读(201) 评论(0) 推荐(0)
2015年1月5日
【leetcode】Maximum Subarray
摘要： Maximum SubarrayFind the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[−... 阅读全文
posted @ 2015-01-05 20:08 H5开发技术 阅读(232) 评论(0) 推荐(0)
【leetcode】Minimum Path Sum
摘要： Minimum Path SumGiven amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along ... 阅读全文
posted @ 2015-01-05 15:13 H5开发技术 阅读(175) 评论(0) 推荐(0)
【leetcode】Unique Paths II
摘要： Unique Paths IITotal Accepted:22828Total Submissions:81414My SubmissionsFollow up for "Unique Paths":Now consider if some obstacles are added to the g... 阅读全文
posted @ 2015-01-05 14:27 H5开发技术 阅读(198) 评论(0) 推荐(0)
2015年1月4日
【leetcode】Unique Paths
摘要： Unique PathsA robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right a... 阅读全文
posted @ 2015-01-04 22:56 H5开发技术 阅读(207) 评论(0) 推荐(0)
【leetcode】Remove Duplicates from Sorted Array II
摘要： Remove Duplicates from Sorted Array IIFollow up for "Remove Duplicates":What if duplicates are allowed at mosttwice?For example,Given sorted array A =... 阅读全文
posted @ 2015-01-04 21:13 H5开发技术 阅读(158) 评论(0) 推荐(0)
【leetcode】Populating Next Right Pointers in Each Node II
摘要： Populating Next Right Pointers in Each Node IIFollow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any ... 阅读全文
posted @ 2015-01-04 20:39 H5开发技术 阅读(206) 评论(0) 推荐(0)
【leetcode】Populating Next Right Pointers in Each Node
摘要： Populating Next Right Pointers in Each NodeGiven a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLi... 阅读全文
posted @ 2015-01-04 18:53 H5开发技术 阅读(224) 评论(0) 推荐(0)
2015年1月3日
【leetcode】Longest Valid Parentheses
摘要： Longest Valid ParenthesesGiven a string containing just the characters'('and')', find the length of the longest valid (well-formed) parentheses substr... 阅读全文
posted @ 2015-01-03 21:04 H5开发技术 阅读(149) 评论(0) 推荐(0)
【leetcode】Word Search
摘要： Word SearchGiven a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, wh... 阅读全文
posted @ 2015-01-03 19:31 H5开发技术 阅读(191) 评论(0) 推荐(0)
【leetcode】Integer to Roman
摘要： Integer to RomanGiven an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.罗马数字的组数规则,有几条须注意掌握；(1)基本数字Ⅰ、... 阅读全文
posted @ 2015-01-03 17:11 H5开发技术 阅读(187) 评论(0) 推荐(0)
【leetcode】First Missing Positive
摘要： First Missing PositiveGiven an unsorted integer array, find the first missing positive integer.For example,Given[1,2,0]return3,and[3,4,-1,1]return2.Yo... 阅读全文
posted @ 2015-01-03 16:35 H5开发技术 阅读(143) 评论(0) 推荐(0)
【leetcode】Edit Distance
摘要： Edit DistanceGiven two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You... 阅读全文
posted @ 2015-01-03 16:06 H5开发技术 阅读(222) 评论(0) 推荐(0)
【leetcode】Container With Most Water
摘要： Container With Most WaterGivennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such t... 阅读全文
posted @ 2015-01-03 15:05 H5开发技术 阅读(161) 评论(0) 推荐(0)
上一页 1 ··· 3 4 5 6 7 8 下一页