算法
文章平均质量分 61
Code Talk
这个作者很懒,什么都没留下…
展开
-
数独生成器
本文介绍了一种用Java实现的数独生成器。数独盘面是个九宫,每一宫又分为九个小格。在这八十一格中给出一定的已知数字和解题条件,利用逻辑和推理,在其他的空格上填入1-9的数字。使1-9每个数字在每一行、每一列和每一宫中都只出现一次,所以又称“九宫格”。算法:本文的实现采用的是回溯法。也就是说,从盘面的第一个格出发,按顺序遍历所有格子。对每一个格子随机生成一个数字,并判断该数字在当前的盘面下是否是合法的。如果不合法,比如同一行已经有相同的数字了,则随机换一个数字。如果当前位置所有数字都不合法,那原创 2022-05-01 23:51:39 · 2377 阅读 · 0 评论 -
Leetcode: Number of Islands
Given a 2d grid map of ‘1’s (land) and ‘0’s (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume原创 2015-05-31 17:36:47 · 356 阅读 · 0 评论 -
Leetcode: Binary Tree Right Side View
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example: Given the following binary tree, 1原创 2015-05-30 20:24:42 · 434 阅读 · 0 评论 -
Leetcode: House Robber II
After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all houses at this place are arranged in a cir原创 2015-05-30 16:19:46 · 364 阅读 · 0 评论 -
Leetcode: Minimum Size Subarray Sum
Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn’t one, return 0 instead.For example, given the array [2,3,1,2,4,原创 2015-05-22 23:19:44 · 400 阅读 · 0 评论 -
Leetcode: Kth Largest Element in an Array
Find 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] and k = 2, return 5.Note:原创 2015-05-23 23:30:37 · 733 阅读 · 0 评论 -
Leetcode: Count Complete Tree Nodes
Given a complete binary tree, count the number of nodes.Definition of a complete binary tree from Wikipedia: In a complete binary tree every level, except possibly the last, is completely filled, and原创 2015-06-06 20:19:52 · 390 阅读 · 0 评论 -
Leetcode: Implement Stack using Queues
Implement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get the top element.empty() -- Return whethe原创 2015-06-14 15:26:45 · 421 阅读 · 0 评论 -
Leetcode: Majority Element II
Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space.这道题和找出现次数超过一半的数的意思类似,只不过这次最多只有两个元素可能满足条件。原创 2015-12-06 21:03:34 · 381 阅读 · 0 评论 -
麻将牌和牌问题
在知乎上看到一个问题,如何用程序判断麻将牌是否和牌。和牌的规则为:14张麻将牌当中,必须要有一个对子,即两张相同的牌,除去对子后,剩下的牌可以组合成”A, A, A”或者”A, A+1, A+2”两种模式的组合,其中A为某种花色的某张牌。我的解法是: 首先定义一下麻将牌在程序中的表示方式: 把万,饼,条分别用连续的数字代表,比如:一万到九万用1到9表示,一饼到九饼用11到19表示,一条到九条用2原创 2016-06-29 20:38:54 · 3060 阅读 · 2 评论 -
Leetcode: Wiggle Subsequence
A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either posi原创 2016-09-11 22:42:59 · 250 阅读 · 0 评论 -
Leetcode: Combination Sum IV
Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.Example:nums = [1, 2, 3] target = 4The possible co原创 2016-09-12 22:23:23 · 393 阅读 · 0 评论 -
Leetcode: Find K Pairs with Smallest Sums
You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k.Define a pair (u,v) which consists of one element from the first array and one element from the second array.原创 2016-09-16 08:07:50 · 267 阅读 · 0 评论 -
Leetcode: 372.Super Pow
Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.Example1:a = 2 b = [3]Result: 8 Example2:a = 2 b = [1,0原创 2016-09-16 22:52:39 · 377 阅读 · 0 评论 -
Leetcode: 368. Largest Divisible Subset
Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or Sj % Si = 0.If there are multiple solutions, return原创 2016-09-17 20:21:25 · 241 阅读 · 0 评论 -
Leetcode: Add and Search Word - Data structure design
Design a data structure that supports the following two operations:void addWord(word)bool search(word)search(word) can search a literal word or a regular expression string containing only letters a-z原创 2015-05-21 20:28:52 · 523 阅读 · 0 评论 -
Leetcode: Repeated DNA Sequences
All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: “ACGAATTCCG”. When studying DNA, it is sometimes useful to identify repeated sequences within the DNA.Write a原创 2015-02-17 14:39:42 · 700 阅读 · 3 评论 -
Leetcode: Text Justification
Given an array of words and a length L, format the text such that each line has exactlyL characters and is fully (left and right) justified.You should pack your words in a greedy approach; that is原创 2014-07-19 14:42:57 · 405 阅读 · 0 评论 -
Leetcode: Largest Rectangle in Histogram
Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where width o原创 2014-06-28 09:02:14 · 441 阅读 · 0 评论 -
Leetcode: Evaluate Reverse Polish Notation
Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples: ["2", "1",原创 2014-06-28 21:52:44 · 383 阅读 · 0 评论 -
Leetcode: Simplify Path
Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"原创 2014-06-29 14:17:33 · 424 阅读 · 0 评论 -
3Sum
Given an array S of n integers, are there elements a,b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b,c) m原创 2014-06-29 23:14:14 · 438 阅读 · 0 评论 -
Leetcode: Minimum Window Substring
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBECODEBANC"T = "ABC"Minimum window is "BANC".原创 2014-06-29 19:14:54 · 453 阅读 · 0 评论 -
Leetcode: Permutation Sequence
class Solution {public: string getPermutation(int n, int k) { vector table(n-1, 0); vector nums(n, 0); } for (i = 0; i < n; i++) { if (nums[i]原创 2014-05-31 18:24:26 · 570 阅读 · 0 评论 -
Leetcode: Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.原创 2014-06-02 14:44:16 · 571 阅读 · 0 评论 -
Leetcode: Scramble String
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation of s1 = "great": great / \ gr原创 2014-06-22 12:35:59 · 561 阅读 · 0 评论 -
Leetcode: Maximal Rectangle
Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.原创 2014-06-22 20:39:23 · 412 阅读 · 0 评论 -
Leetcode: Longest Valid Parentheses
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring is "()", which原创 2014-08-23 00:26:33 · 438 阅读 · 0 评论 -
Leetcode: Spiral Matrix
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]You原创 2014-08-09 22:53:27 · 386 阅读 · 0 评论 -
Leetcode: Valid Number
Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambiguous.原创 2014-09-07 19:15:08 · 387 阅读 · 0 评论 -
Leetcode: Find Minimum in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element.You may assume no duplicate exists in原创 2014-12-01 19:41:54 · 387 阅读 · 0 评论 -
Leetcode: Integer to Roman
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.原创 2014-06-08 10:58:11 · 499 阅读 · 0 评论