12 2016 档案

摘要:Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, 阅读全文
posted @ 2016-12-30 21:41 WillWu 阅读(141) 评论(0) 推荐(0)
摘要:The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order,We get the following sequence 阅读全文
posted @ 2016-12-29 22:01 WillWu 阅读(106) 评论(0) 推荐(0)
摘要:The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. Given an integer n, return all 阅读全文
posted @ 2016-12-28 23:04 WillWu 阅读(140) 评论(0) 推荐(0)
摘要:Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non-neg 阅读全文
posted @ 2016-12-28 13:07 WillWu 阅读(133) 评论(0) 推荐(0)
摘要:Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example,[1,1,2] have the following unique pe 阅读全文
posted @ 2016-12-27 21:56 WillWu 阅读(106) 评论(0) 推荐(0)
摘要:Permutations Given a collection of distinct numbers, return all possible permutations. For example,[1,2,3] have the following permutations 分析: 全排列实现思想 阅读全文
posted @ 2016-12-27 21:41 WillWu 阅读(179) 评论(0) 推荐(0)
摘要:Remove Duplicates from Sorted List II Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the 阅读全文
posted @ 2016-12-06 23:30 WillWu 阅读(188) 评论(0) 推荐(0)
摘要:Reverse Nodes in k-Group Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. If the number of nodes is n 阅读全文
posted @ 2016-12-05 23:16 WillWu 阅读(182) 评论(0) 推荐(0)
摘要:Swap Nodes in Pairs Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list a 阅读全文
posted @ 2016-12-05 20:42 WillWu 阅读(176) 评论(0) 推荐(0)
摘要:经常对一幅图像进行旋转操作,OpenCV中提供了很方便易用的仿射变换函数warpAffine, 通过getRotationMatrix2D可以得到放射变换矩阵(矩阵大小2x3) 效果 原图 旋转后的图片 阅读全文
posted @ 2016-12-05 13:59 WillWu 阅读(16238) 评论(2) 推荐(2)