Shao shao-wang-me

## acceptTrackedChanges.script
builder.OpenFile("https://github.com/shao-wang-me/delete-me-later/raw/main/tracked_changes.docx");
var oDocument = Api.GetDocument();
oDocument.AcceptAllRevisionChanges();
oDocument.SetTrackRevisions(false);
builder.SaveFile("docx", "AcceptAllRevisionChanges.docx");
builder.CloseFile();

## leetcode_508.py
# 508. Most Frequent Subtree Sum
# https://leetcode.com/problems/most-frequent-subtree-sum/
# Easy

# Definition for a binary tree node.
# class TreeNode:
#   def __init__(self, val=0, left=None, right=None):
#     self.val = val
#     self.left = left
#     self.right = right

## vis-timeline-basic-usage.html
<!doctype html>
<html>
<head>
  <title>Timeline | Basic demo</title>

  <style type="text/css">
    body, html {
      font-family: sans-serif;
    }
  </style>

## elastic_australian_people.py
"""A script to generate fake Australian demographic data, and index into Elasticsearch.

Python requirements:
    * elasticsearch
    * faker
Elasticsearch requirements:
    * phonetic plugin
    * name_synonyms.txt in elasticsearch-<version>/config/

Author: Shao Wang

## android_dev_notes.txt
Kotlin, Java, C++

1. App components (entry points of app):
  - Activity
  - Service
  - Broadcast receiver
  - Content Provider

2. Activity (UI)
  - Represents a single screen

## saving_large_data.py
import numpy as np
import json
import pickle

a = np.random.random(1000000)
# a = np.zeros(1000000)
print(a)

a.dump('np_dump')
with open('pickle_dump', 'wb') as f:

## count_lines.py
"""Print number of lines of all files in a directory (default is the currect directory) and its subdirectories.
"""
import os
import sys


def count_file_lines(filepath):
    """Count lines in a file
    """
    lines = 0
	builder.OpenFile("https://github.com/shao-wang-me/delete-me-later/raw/main/tracked_changes.docx");
	var oDocument = Api.GetDocument();
	oDocument.AcceptAllRevisionChanges();
	oDocument.SetTrackRevisions(false);
	builder.SaveFile("docx", "AcceptAllRevisionChanges.docx");
	builder.CloseFile();
	# 508. Most Frequent Subtree Sum
	# https://leetcode.com/problems/most-frequent-subtree-sum/
	# Easy

	# Definition for a binary tree node.
	# class TreeNode:
	# def __init__(self, val=0, left=None, right=None):
	# self.val = val
	# self.left = left
	# self.right = right
	<!doctype html>
	<html>
	<head>
	<title>Timeline \| Basic demo</title>

	<style type="text/css">
	body, html {
	font-family: sans-serif;
	}
	</style>
	"""A script to generate fake Australian demographic data, and index into Elasticsearch.

	Python requirements:
	* elasticsearch
	* faker
	Elasticsearch requirements:
	* phonetic plugin
	* name_synonyms.txt in elasticsearch-<version>/config/

	Author: Shao Wang
	Kotlin, Java, C++

	1. App components (entry points of app):
	- Activity
	- Service
	- Broadcast receiver
	- Content Provider

	2. Activity (UI)
	- Represents a single screen
	import numpy as np
	import json
	import pickle

	a = np.random.random(1000000)
	# a = np.zeros(1000000)
	print(a)

	a.dump('np_dump')
	with open('pickle_dump', 'wb') as f:
	"""Print number of lines of all files in a directory (default is the currect directory) and its subdirectories.
	"""
	import os
	import sys


	def count_file_lines(filepath):
	"""Count lines in a file
	"""
	lines = 0