james的专栏

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 assu

Given an array of integers and an integer k, find out whether there there are two distinct indicesi and j in the array such that nums[i] = nums[j] and the difference betweeni and j is at most k.

Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree and sum = 22, 5 / \

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element

Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is

Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.主要弄清楚罗马数字的表示方法：I - 1II- 2III-3IV-4V - 5X - 10L - 50

Write a function to find the longest common prefix string amongst an array of strings.直接进行扫描即可。class Solution {public: string longestCommonPrefix(vector &strs) { int findFlag=0,po

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the tota

Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[1,1,2], [1,2,1], and [2,1,1].

Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11' has binary representation 00000000

Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as0011100101

Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replaced with anot

Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the larges

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [−2,1,−3,4,−1,2,1,−5,4],the contiguous subarray [4,−1,2,1] ha

Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2 1 \

用栈实现队列leetcode ：Implement Queue using Stacks Implement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes the element

Given an integer, write a function to determine if it is a power of two.题目意思：判断某个数是否是2的幂。方法：直接进行bit运算，判断是否这个数二进制位里有且仅有一个1。class Solution {public: bool isPowerOfTwo(int n) { int c=0;

Given two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t = "car", return false.Note:You may a

Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.方法：找1...n中每个数因式分解中，5的个数（5的个数一般大于2的个数），即为10的个数注意：题目要求时间复杂度：

Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.Assume that the tota

Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.直接递归调用判断就好

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20

参考了算法竞赛入门经典那本书p125：#include const int n=4;int tol=0;int arr[n];//输出某个解void print_res(int arr[],int n){ for(int i=0; i<n; i++) { for(int j=0; j<n; j++) { if(arr[i]==j) printf(

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",

Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using ext

class Solution {public: vector getRow(int rowIndex) { vector ivCur; if(rowIndex<0) return ivCur; else { vector ivPre; for(int r

Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]

没有利用多余的存储空间，将链表分成两个子链表，然后对一个进行

Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes are labeled uniquely.We use # as a separator for each

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list.思路：

Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region .For example,X X X XX O O XX X O

Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree and sum

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

主要参考严老师那边教材上的实现的：#include #include #define LIST_INIT_SIZE 100//线性表存储空间初始分配量#define LISTINCREMENT 10//空间不够时，增量分配#define ElemType inttypedef struct{ ElemType *elem;//当前分配的存储空间基址 int length;/

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.题目就是合并两个有序的链表，具体方法就是：直接操作两个链表的各个指针域，使得最后两个链表连成一个有

Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A partially fille

题目：判断是否是回文数（空间要求不能用额外的）注意：负数不是回文数class Solution {public: bool isPalindrome(int x) { if(x<0) return false; int tmp=x,res=0; while(tmp) {

/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti