上一页 1 2 3 4 5 6 7 ··· 21 下一页
摘要: 1.基础类TransferFiles,client和server都需要using System;using System.Collections.Generic;using System.Text;using System.Net;using System.Net.Sockets;using Sys... 阅读全文
posted @ 2014-05-30 13:44 erictanghu 阅读(10964) 评论(2) 推荐(3) 编辑
摘要: 1.http://docs.seleniumhq.org/ 下载seleium包2.新建一个C#项目,比如控制台,引用seleium包中的dllusing System;using System.Collections.Generic;using System.Text;using OpenQA.S... 阅读全文
posted @ 2014-05-30 13:39 erictanghu 阅读(651) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ ... 阅读全文
posted @ 2014-05-30 01:22 erictanghu 阅读(123) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and al... 阅读全文
posted @ 2014-05-30 01:22 erictanghu 阅读(206) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,9,2... 阅读全文
posted @ 2014-05-30 01:22 erictanghu 阅读(74) 评论(0) 推荐(0) 编辑
摘要: Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree./** * Definiti... 阅读全文
posted @ 2014-05-30 01:22 erictanghu 阅读(93) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le... 阅读全文
posted @ 2014-05-30 01:22 erictanghu 阅读(76) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For exa... 阅读全文
posted @ 2014-05-30 01:22 erictanghu 阅读(83) 评论(0) 推荐(0) 编辑
摘要: Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree./** * Definitio... 阅读全文
posted @ 2014-05-30 01:22 erictanghu 阅读(121) 评论(0) 推荐(0) 编辑
摘要: Given an array where elements are sorted in ascending order, convert it to a height balanced BST./** * Definition for binary tree * struct TreeNode { ... 阅读全文
posted @ 2014-05-30 01:22 erictanghu 阅读(145) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 ··· 21 下一页