lydcsdn

Binary Tree Maximum Path Sum leetcode 递归

#include<iostream>#include<stack>#include<cstring>using namespace std;int R,C;//行列数int rooms[60][60];int color[60][60];//房间染色标记int maxRoomArea=0,roomNum=0;int roomArea;void Dfs(int i,int k){

蓄水池问题思路1，从左扫描一遍，从右扫描一遍思路2，两个指针分别从左右扫描#include using namespace std;int getMaxVolume(int arr[],int len){ int pl=0; //int pr=sizeof(arr)/sizeof(arr[0])-1;//arr is a pointer int pr=le

深搜package Lesson1;public class MyDeep { public static void deepTravel(int[][] a, int[] color, int k) { System.out.println(k); color[k] = 1;// 标记为已访问 for (int i = 0; i < a[k].length; i++)

wakeng

package bishi;import java.util.HashMap;import java.util.Map;import java.util.Stack;public class MyExpression { public static void calcu(Stack datas, Stack ops) { // 后弹出的放在右边 int b = (Integ

递归

如"i am a student" 倒置为 "student a am i"

1、2N+1个数中有一个是不一样的，其他书

博弈树

挖坑

测试。。

dfs

试探+回溯

#include<iostream>#include<vector>#include<algorithm>#include<cstring>using namespace std;short rowFlags[9][10];//rowFlags[i][num]=1表示在第i行已经放了数字numshort colFlags[9][10];//colFlags[j][num]=1表示在第j列已

leetcode Maximum Subarray

search a 2D Matrix

Construct Binary Tree from Preorder and Inorder Traversalclass Solution {public: TreeNode *buildTreebyIndex(vector &preorder,int preBegin,int preEnd,vector &inorder,int inBegin,int inEn

0-1背包，动态规划

leetcode Decode Ways

leetcode Find Peak Element

leetcode Find Minimum in Rotated Sorted Array II

leetcode find mininum in rotated sorted array

leetcode Median of Two Sorted Arrays

POJ3278 Catch That Cow

leetcode Combination sum

leetcode combination sum

荷兰国旗问题 Sort Colors

leetcode Number of Islands

双端队列 maxSlidingWindow deque

单源最短路径边权不等，

Josephus Problem：解法1、模拟法，使用xun'hu

Longest Increasing Subsequence

#include "iostream"using namespace std;/**Definition for singly-linked list.*/struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {}};class Solution {

#include "iostream"using namespace std;class Solution {public: void reverseWords(string &s) { int len=(int)s.length()-1;//显示转换unsigned long to int string res=

#include #include //mac os下引用unordered_set,散列容器#include #include using namespace std;class Solution {public: int ladderLength(string start, string end, unordered_set &dict) {

class Solution {public: bool exist(vector > &board, string word) { if (word.size()==0) { return true;//空串返回true } int row=board.size(); int co

#include #include using namespace std;int main(){ cout<<"pls input 3 numbers a,b,c (0<a,b,c<10 and a!=b!=c):"<<endl; int x1,x2,x3; cin>>x1>>x2>>x3; string str1,str2,str3; ost

http://sjjg.js.zwu.edu.cn/SFXX/sf1/sfys.html

#include#define LeapYear(year) ((year%4==0&&year%100!=0)||year%400==0)/** 把判断闰年的算法写成一个宏，是闰年返回1，否则返回0。*/int main(){ int year,month,day,i,sum; int ly[2][13]= { {0,31,28,31,30,3