ValerieJJ-CSDN博客

原创排序算法java

// "static void main" must be defined in a public class.import java.util.Arrays; public class Main { public static void main(String[] args) { int[] arr = {1,2,0,5,3,2}; // BubbleSort(arr); // SelectSort(arr); // Insert

2021-11-04 18:16:09 123

原创剑指 Offer 47. 礼物的最大价值

剑指 Offer 47. 礼物的最大价值class Solution { public int maxValue(int[][] grid){ int n = grid.length; int m = grid[0].length; for(int i=1;i<n;i++){ grid[i][0] += grid[i-1][0]; } for(int j=1;j<m;j++){

2021-10-28 20:15:07 114

原创 pandas dataframe

import pandas as pdimport numpy as npwith open("myDBLP/demo.txt", 'r') as fr: lines = fr.readlines()authors_id = []authors_name = []authors_label = []for line in lines: # type(line)==str, type(lines)==list data = line.split('\t') authors

2021-10-28 10:35:19 144

原创剑指 Offer 04. 二维数组中的查找

class Solution { public boolean findNumberIn2DArray(int[][] matrix, int target) { int n = matrix.length; if(n==0) return false; int m = matrix[0].length; if(m==0) return false; if(target<matrix[0][0] || targe.

2021-10-27 20:42:28 91

原创剑指 Offer 63. 股票的最大利润(DP)

class Solution { public int maxProfit(int[] prices) { int days = prices.length; if(days==0) return 0; int[] dp = new int[days]; int minprice = prices[0]; for(int i=1;i<days;i++){ if(prices[i]<..

2021-10-27 20:08:01 69

原创剑指 Offer 26. 树的子结构

法一两层迭代/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { public boolean recur(TreeNode curA, TreeNode curB){.

2021-10-27 15:28:19 47

原创剑指 Offer 28. 对称的二叉树

/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { public boolean check(TreeNode A, TreeNode B){ if(A=.

2021-10-27 15:19:44 46

原创剑指 Offer 27. 二叉树的镜像 - 2种解法

/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { public TreeNode mirrorTree1(TreeNode root){ if(root.

2021-10-26 16:41:37 62

原创 Hbase高可用

Hbase高可用的玩法主节点master上start-hbase.sh开启第二个从节点hadoop0:hbase-daemon.sh start regionserver这时候还不是高可用，因为集群中只有一个HMasterBackup master = 0这时如果主节点master挂掉了，Hbase不可用高可用模式：在hadoop0上也开启Hmaster：hbase-daemon.sh start master这样集群中就有了两个HMaster（状态不同，hadoop0是备用的b

2021-10-26 10:48:04 644

原创 pandas 数据清洗(Personal Notes)

A demo of pandas ，数据清洗import pandas as pdimport numpy as np## n = 30# m = 5# index = ["line-{}".format(i) for i in range(n)]# columns = ["col-{}".format(i) for i in range(m)]# df = pd.DataFrame(# np.random.randn(n, m),# index=index,#

2021-10-24 21:37:46 83

原创 leetcode printListFromTailToHead

# class ListNode:# def __init__(self, x):# self.val = x# self.next = None#class Solution: def printListFromTailToHead(self , listNode: ListNode) -> List[int]: # write code here if listNode == None:

2021-10-20 01:26:36 146

原创剑指offer 09 用两个栈实现一个队列

class CQueue: def __init__(self): self.inStack = [] self.outStack = [] def appendTail(self, value: int) -> None: self.inStack.append(value) def deleteHead(self) -> int: if len(self.outStack)==0:.

2021-10-19 09:47:22 54

原创 HDFS shell commands

hdfs fs命令hadoop官方手册显示根目录下所有内容jj@JJ:~$ hadoop fs -ls /Found 6 itemsdrwxr-xr-x - jj supergroup 0 2021-08-19 22:46 /exm_wdcnt_hadrwxr-xr-x - jj supergroup 0 2021-09-14 16:21 /hbasedrwxr-xr-x - jj supergroup 0 2021-09-1

2021-09-15 15:27:18 83

原创多态实现 callback, register函数

#include<iostream>using namespace std;typedef int (*func_ptr)(int, int); // function poniterint add(int a, int b){ cout<<"this is add function"<<endl; return a+b;}int sub(int a, int b){ cout<<"this is sub function"

2021-09-14 15:46:52 217

原创 pickle json

pickle vs jsonJSON 是一个文本序列化格式（它输出 unicode 文本，尽管在大多数时候它会接着以 utf-8 编码），而 pickle 是一个二进制序列化格式；JSON 是我们可以直观阅读的，而 pickle 不是；JSON是可互操作的，在Python系统之外广泛使用，而pickle则是Python专用的；默认情况下，JSON 只能表示 Python 内置类型的子集，不能表示自定义的类；但 pickle 可以表示大量的 Python 数据类型pickle dump(), d

2021-09-14 15:14:25 108

原创 Ubuntu 配置vscode cpp

launch.json直接使用默认即可，不用修改tasks.json{ "version": "2.0.0", "tasks": [ { "type": "shell", "label": "C/C++: g++ build active file", "command": "/usr/bin/g++", "args": [ "-g", "${file}", "-o", "${fileDirname}/${fileBasenameN.

2021-09-14 14:47:58 78

原创 53 最大子串和Maximum Subarray

分治法pythondef maxSub(nums,left,right): if left==right: return nums[left] mid = int((left+right)/2) print("mid=",mid) leftmax = maxSub(nums,left, mid) rightmax = maxSub(nums,mid+1,right) mid_left_sum = 0 mid_right_sum = 0

2021-09-14 03:42:05 76

原创 Java - LinkList

public class LinkList_exm { private class Node{ int val; Node next; Node(int val){ this.val = val; this.next = null; } } private Node head,tail; private int size; /** * 链表构造函数 */ public LinkList_exm() { Node p= new Node(0); ..

2021-09-13 22:52:02 95

原创 hdfs+neo4j cypher (Personal Notes)

cypher导入csv文件将节点csv文件和边集csv文件放于import文件夹中，导入people.csv节点集 load csv from "file:///people.csv" as line create (a:Author{name:line[0]})导入edges.csv边集load csv from "file:///edges.csv" as linematch(a:Author),(b:Author)where ID(a)=toInteger(line[0]) an

2021-09-13 22:43:01 161

原创 GraphData图数据处理

import networkx as nximport matplotlib.pyplot as pltG = nx.Graph()#. add nodes with attributes: person1 = (0, {"name":"mike", "age":23, "career":"student"})person2 = (1, {"name":"jack", "age":63, "career":"teacher"})person3 = (2, {"name":"paris", "

2021-09-09 21:44:13 412

原创 300. Longest Increasing Subsequence

300. Longest Increasing Subsequencepublic class Main{ public int lengthOfLIS(int[] nums){//动态规划做法 int length = nums.length; int[] dp = new int[length]; dp[0] = 1; int res = 1; for(int i=1;i<length;i++){

2021-09-07 13:37:41 56

原创 509 Fibonacci Number‘

class Solution { public int fib(int n) { int[] dp = new int[n+1]; for(int i=0; i<=n; i++){ if(i==0 || i==1){ dp[i] = i; }else{ dp[i] = dp[i-1] + dp[i-2]; }

2021-09-07 09:11:48 68

原创 1143 LongestCommenSubsequence

#include<iostream>#include<string>#include<cstdio>using namespace std;//int dp[1000][1000];int longestCommonSubsequence(string text1, string text2) { int len1 = text1.length(); int len2 = text2.length(); int dp[1000][100

2021-09-03 13:48:36 45

原创 62 Unique Paths(DT)

62 Unique Paths// javaclass Solution { public int uniquePaths(int m, int n) { int[][] f = new int[m][n]; for(int i=0;i<m;i++){ for(int j=0; j<n; j++){ if(i==0||j==0){ f[i][j] = 1; }else{ f[i][j] = f[i][j-1] + f[i-1][j];

2021-09-01 01:51:45 79

原创 322 coins change(DT)

322 coins changeclass Solution { public int coinChange(int[] coins, int amount) { int n = coins.length; int[] f = new int[amount+1]; //记录状态 f[0] = 0; int i,j; // f[1],f[2], ..., f[amount] for(i=1;i<=amount;i++){ f[i] = Integer.MAX_

2021-09-01 01:19:43 82

原创 Valid Parentheses

Valid Parenthesesdef isValid(s: str)->bool: stk = [] for i in s: if i in "([{": stk.append(i) elif i == ")": if len(stk)==0 or stk[-1]!="(": return False else:

2021-08-27 15:14:06 56

原创 32 Longest Valid Parentheses

32. Longest Valid Parenthesesdef longestValidParentheses(s: str)->bool: result = 0 start = 0 stk = [] length = len(s) for i in range(length): if s[i] == "(": # 用栈记录左括号的下标 stk.append(i) else: # s[i] == "

2021-08-27 15:11:58 68

原创计算机网络 VMware

三种网络模式Bridge 桥接模式新建虚拟机的时候默认选择的；VMware虚拟出来的操作系统就像是局域网中的一独立的主机，它可以访问网内任何一台机器。不过需要多于一个的IP地址，并且需要手工为虚拟系统配置IP地址、子网掩码，而且还要和宿主机器处于同一网段，这样虚拟系统才能和宿主机器进行通信。如果你想利用VMware在局域网内新建一个虚拟服务器，为局域网用户提供网络服务，就应该选择桥接模式。NAT 网络地址转换模式使用NAT模式可以实现在虚拟系统里访问互联网如果你想利用VMware安装一个新的虚

2021-08-23 22:29:22 65

原创 BinarySearchTree

class Node: def __init__(self,data): self.data = data self.id = 0 self.left = None self.right = None self.parent = None self.pos = Noneclass BinaryTree: def __init__(self, node_list): # s.

2021-08-22 22:39:37 69

原创 Java Basis

JDK java工具包JRE java运行环境JVM java虚拟机，是JRE的一部分详解 JVM生命周期使用JDK（调用JAVA API）开发JAVA程序后，通过JDK中的编译程序（javac）将Java程序编译为Java字节码，在JRE上运行这些字节码，JVM会解析并映射到真实操作系统的CPU指令集和OS的系统调用。...

2021-08-22 20:35:16 73

原创 PySpark！！！

Start from wordcount首先确保hadoop启动，hdfs可以使用/etc/profile中设置pyspark使用miniconda中虚拟环境thjj的pythonexport PYSPARK_PYTHON=/home/jj/miniconda3/envs/thjj/bin/python # 打印 hdfs 根目录下的所有文件jj@JJ:~/Desktop$ hadoop dfs -ljj@JJ:~/Desktop$ pysparkPython 3.6.13 |Anac

2021-08-21 17:37:40 119

原创 Ubuntu20.04环境下 virtualBox装win10 简记

官网安装VMware-Workstation-Full-7.0.0-203739.x86_64.bundle#赋予可执行权限sudo chmod +x VMware-Workstation-Full-7.0.0-203739.x86_64.bundle#使用root权限启动sudo ./VMware-Workstation-Full-7.0.0-203739.x86_64.bundle下载win10镜像打开virtual box创建后，点击设置https://z.

2021-08-21 14:56:33 434

原创 kdd gnn

kdd gnnhttps://zhuanlan.zhihu.com/p/400419811

2021-08-18 23:55:58 66

原创 Hadoop & Spark

Spark Standalonestart-master.shjj@JJ:~/Desktop$ start-master.shstarting org.apache.spark.deploy.master.Master, logging to /home/jj/Downloads/spark-3.1.2-bin-hadoop3.2/logs/spark-jj-org.apache.spark.deploy.master.Master-1-JJ.out重复运行start-master.sh，给出进程

2021-08-18 13:58:58 638

空空如也

空空如也